资源列表
牛顿法
- 基本牛顿法是一种是用导数的算法，它每一步的迭代方向都是沿着当前点函数值下降的方向。(The basic Newton method is a derivative algorithm, in which the direction of each iteration is in the direction of the decrease of the function value at the current point.)
Estimation_Kalman
- Using Kalman filter for estimaiton
ITU_R
- Multipath channel, LTE standards
抛物线法
- 抛物线法是求无约束一维极值的一种方法，也叫二次插值法，其理论依据为二次多项式可以在最优点附近较好的逼近函数的形状，做法是在函数的最优点附近取三个构造点，然后用这三个点构造一条抛物线，把这条抛物线的极值点作为函数的极值点的近似(The parabola is a method of solving a constrained one-dimensional extremum method, also called two times interpolation method, the theore
最速下降法
- 梯度下降法是一个最优化算法，通常也称为最速下降法。最速下降法是求解无约束优化问题最简单和最古老的方法之一，虽然现在已经不具有实用性，但是许多有效算法都是以它为基础进行改进和修正而得到的。最速下降法是用负梯度方向为搜索方向的，最速下降法越接近目标值，步长越小，前进越慢。(The gradient descent method is an optimization algorithm, also known as steepest descent. The steepest descent meth
MyLFM
- to make LFM(Linear Frequency Modulation) signal
anova
- 单因素方差分析程序设计，进行显著性分析。(A single factor analysis of variance procedure was designed to perform a significant analysis.)
power
- 运用MATLAB语言计算功率谱，运用的是加权交叠法计算(The power spectrum is calculated by using MATLAB language, and weighted overlapping method is used)
entropy
- 计算信号的样本熵，近似熵，排序熵以及小波熵(The sample entropy, approximate entropy, sorting entropy and wavelet entropy of the signal are calculated)
motaifenxi
- 本程序可用于对时间序列数据进行模态分析，亲测可用(This procedure can be used for modal analysis of time series data, pro test available)
45880713Exterme_k_means
- Extreme k-means，被yuboYuan提出，给定初始聚类中心，聚类快。(Extreme K-means is put forward by yuboYuan, given the initial clustering center, and the clustering is fast.)
99273863K-means-clustering-algorithm
- K-均值聚类算法。可自由输入初始聚类中心的个数和其坐标。(K- means clustering algorithm. The number of initial cluster centers and its coordinates can be freely entered.)