LLF-to-identify-parameters

Karhunen Loeve算法实现过程，该项算法可用于图像的压缩和分类(Karhunen Loeve algorithm process, the algorithm can be used for image compression and classification)

设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)

基于Markov方法的风机出力预测方法，具有较强的可转换性(The method of wind power forecast using Markov)

matlab的GPS工具箱，亲测可用，内附使用说明(GPStoolbox of matlab)

kuanjiange_seq.m 基于对偶频带法和m序列，产生一个宽间隔跳频序列。 kuanjiange_seqencezu.m 基于对偶频带法和m序列，产生一个宽间隔跳频序列族。 注：其中的m序列是利用三个非相邻级控制频率合成器构造 L_G模型。(kuanjiange_seq.m based on dual band m sequence, have a wide interval frequency hopping sequence. Kuanjiange_seqencezu.m based on dual band and m sequence, have a wide interval frequency hopping sequences. Note : The use of m-sequences are non-adjacent three-level control frequency synthesizer L_G tectonic model.)

Fourier Transforms Using Matlab 英文，清晰pdf版(Fourier Transforms Using Matlab in English, a clear pdf version)

囚徒困境中的博弈策略的模拟：尝试了采用几种策略进行博弈使最终双赢的概率变大。(prisoner s dilemma：several strategies’ comparison)

带通采样定理的验证以及在无线电全数字中频直扩接收机的应用 (Verify bandpass sampling theorem)

matlab programme to find mean value

Matlab中文手册，能很好的帮助你使用Matlab的函数和文件，很好用！(Chinese Matlab manual can help you use the good function of Matlab and documents, a very good use!)