EE587HW3

matlab5 手册 教程 参考(Course reference manual matlab5)

说明：  精通MATLAB优化计算算法，非线性最小二乘问题。共3个程序。(Proficient in MATLAB optimization calculation algorithm, nonlinear least squares problems. A total of three procedures.)

同步挤压小波变换的源代码以及几个实例,这些代码由作者Gaurav Thakur等人编写，非常经典。(synchroqueezing wavelet transform)

包括 MUSIC算法，ESPRIT算法 ROOT-MUSIC算法，FMCW调频连续波雷达的测距测角，是本科毕设的题目。( Including the MUSIC algorithm, ESPRIT algorithm ROOT-MUSIC algorithm, FMCW frequency modulated continuous wave radar range and angular measurements, The title of the commercial is undergraduate course yo.)

It is the code to demonstrate actof filtering

数学建模，matlab实现主成分分析法，以及直方图绘制( Mathematical modeling, matlab principal component analysis, and the histogram drawing )

人工鱼群算法 自己编写 经过测试 适合初学者(AFSA write yourself tested for beginners)

window 下的lua源码，值得学习,欢迎大家一起学习，下载(lua source window down, it is worth learning, welcome everyone to learn together, to download)

阵列信号处理的基本程序，包括music等(Array signal processing of the basic procedures, including music, etc.)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )