-
SQP
本算法是基于数值计算中的SQP编写的MATLAB程序。非常实用的一个小程序。(This algorithm is based on the numerical calculation of SQP written MATLAB program. Very practical one small program.)
- 2020-12-29 10:39:00下载
- 积分:1
-
cplex
使用java语言调用cplex求解简单案例(use java language with cplex solver to solve some simple cases)
- 2018-06-19 15:48:25下载
- 积分:1
-
时间序列
利用MATLAB程序实现时间序列的预测功能(Using MATLAB program to achieve prediction function of time series.)
- 2018-04-17 15:00:34下载
- 积分:1
-
giumiu_v41
wolf 方法计算李雅普诺夫指数,用于时频分析算法,旋转机械二维全息谱计算的实用例程。( wolf calculated Lyapunov exponent, For time-frequency analysis algorithm, Rotating Machinery dimensional hologram of practical spectrum calculation routines.)
- 2017-02-28 13:53:12下载
- 积分:1
-
rotor-dynamics
大部分机械都是以转子形式运转,这本转子动力学是研究旋转机械动力学的基础(Most of the machinery are operating a rotor and the rotor dynamics is the study of the dynamics of rotating machinery foundation)
- 2013-02-20 11:07:16下载
- 积分:1
-
lagrange
拉格朗日插值函数,自己编的,供大家参考学习(Lagrange interpolation function, own, and for reference study)
- 2015-11-16 11:58:36下载
- 积分:1
-
MATHMATICAL STATISTICS
说明: 分别对beta估计值模拟分析、非中心对称分布、卡方拟合优度检验、筛选抽样随机数抽取、有限样本性质模拟这5个内容进行了编程说明(The five contents of beta estimation simulation analysis, non-centrosymmetric distribution, chi-square goodness-of-fit test, random number extraction of screening sampling and Simulation of finite sample properties are explained by programming.)
- 2019-01-10 09:45:54下载
- 积分:1
-
random_position
说明: 关闭OFDM信号子载波,画出OFDM信号频谱图,查看旁瓣泄露情况(Close OFDM signal sub-carrier OFDM signal spectrum plot, view the situation sidelobe leakage)
- 2011-04-03 22:21:37下载
- 积分:1
-
nijie
六轴工业机器人的逆运动学,采用VC++进行编程自动求解(inverse of 6-dof industrial robot)
- 2020-12-25 12:19:04下载
- 积分:1
-
hartigansSLC_OpenCV
hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1)
Sequential Leader algorithm:
Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY.
1. Select maximum cluster "radius"
2. Start with zero clusters
3. Add each item to be clustered to:
* Closest cluster if distance <= r
* New cluster if distance to closest cluster > r
4. Compute new center from members in cluster
5. Empty the clusters (keeping the centers)
6. Return to step 3 (until no changes are made)
- 2010-02-25 19:28:25下载
- 积分:1