-
MOBJ
Set of files to run "decisor_correlacao_generalizado".
- 2010-11-17 06:05:45下载
- 积分：1
-
hdlsrc
low pass filter desined in matlab signal toolbox butterworth fiter
- 2012-05-07 04:31:10下载
- 积分：1
-
test_lda
lda基本思想是选择使得Fisher准则函数达到极值的向量作为最佳投影方向，从而使得样本在该方向上投影后，达到最大的类间离散度和最小的类内离散度(Linear classification algorithm)
- 2013-08-01 09:36:06下载
- 积分：1
-
angvec2r
移动机器人matlab仿真程序，很好用的，可以学习学习。(Mobile robot matlab simulation program, the good, you can learn.)
- 2013-09-01 17:37:00下载
- 积分：1
-
figure-2.2.2
1. Compare undamped SDOF system with damped SDOF system
2. Consist of matlab source code(*.m) and graphic file(*.eps)
- 2012-06-27 10:48:35下载
- 积分：1
-
Gaussian_interpolation
插值算法，具体使用方向为高斯插值，Kriging插值可以参考(Interpolation algorithm, the specific direction of the Gaussian interpolation, Kriging interpolation can refer to)
- 2010-12-08 12:42:56下载
- 积分：1
-
suanfa
10个基本阵列，方向60 ，80，85,120,130 通用INR=5dB，用music，capon，线性预测，波束形成等四种算法画出功率谱图。(10 basic arrays, direction 60, 80,85,120,130 common INR = 5dB, with music, capon, linear prediction, beamforming and other four algorithms to draw power spectrum.)
- 2011-08-03 22:52:04下载
- 积分：1
-
ROOT-MUSIC
文章的作者进行了基于行列合成的实值二维ROOT-MUSIC算法的仿真分析(The authors were synthesized based on the ranks of real two-dimensional ROOT-MUSIC algorithm simulation)
- 2010-11-07 19:57:01下载
- 积分：1
-
binar
hai this isuseful for all
- 2010-03-13 22:50:53下载
- 积分：1
-
Optimization_Newton
设r是f(x) = 0的根，选取x0作为r初始近似值，过点（x0,f(x0)）做曲线y = f(x)的切线L，L的方程为y = f(x0)+f (x0)(x-x0)，求出L与x轴交点的横坐标 x1 = x0-f(x0)/f (x0)，称x1为r的一次近似值。过点（x1,f(x1)）做曲线y = f(x)的切线，并求该切线与x轴交点的横坐标 x2 = x1-f(x1)/f (x1)，称x2为r的二次近似值。重复以上过程，得r的近似值序列，其中x(n+1)=x(n)－f(x(n))/f (x(n))，称为r的n+1次近似值(Let r is f (x) = 0 root, select the initial approximation x0 as the r, over point (x0, f (x0)) to do the curve y = f (x) the tangent L, L the equation y = f ( x0)+ f ' (x0) (x-x0), find the intersection of L and the x-axis of abscissa x1 = x0-f (x0)/f' (x0), x1 is called an approximation r. Through points (x1, f (x1)) to do the curve y = f (x) the tangent, and find the intersection of the tangent with the x-axis of abscissa x2 = x1-f (x1)/f ' (x1), x2 is called r the second approximation. Repeat the process, get an approximation of the sequence r, where x (n+1) = x (n)-f (x (n))/f ' (x (n)), as an approximation of r n+1 times)
- 2011-06-21 21:13:09下载
- 积分：1
