MATLAB-GUI

多变量无约束问题的优化最优化方法之梯度下降法(Optimization of the gradient descent method)

关于介绍小波在信号和图像中的应用，有大量例子说明~(On the introduction of wavelet in signal and image applications, there are numerous examples to illustrate ~)

RS编解码的Matlab源代码，拿来和大家分享(RS codec Matlab source code, used to share)

this file is the program of the module GPV

推算GPS卫星24小时内的位置，matlab程序，本人花了很多时间编写！(projections GPS satellite within 24 hours of the location of Matlab procedures, I spent a lot of time to prepare!)

This is a matlab ea, implements a high pass filter

MATLAB的图形界面GUI设计实现课程设计中的iwGzuF编码算法，并仿真ACXMSTh参数在不同条件下的误码率性能曲线，与现有算法对比，性能良好，界面友好。 (MATLAB graphical interface GUI design and implementation of curriculum design iwGzuF coding algorithm and simulation ACXMSTh parameters BER performance curve under different conditions, and existing algorithms contrast, good performance, friendly interface. )

异步电动机的矢量控制异步电动机是一个高阶、非线性、强耦合的多变量系统,使经典的交流电机理论和传统的控制系统分析方法不能完全适用于现代交流调速系统(Asynchronous motor vector controlled induction motor is a high-order, nonlinear, strongly coupled multivariable system, the classic theory of AC motor and control system analysis methods can not be fully applicable to the modern AC variable speed system)

The program used to calculate the distance transform leaf cell number with the code attached sample images directly on the run

MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<> 迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x(k+1)，直至:|f(x(k+1))|<|f(x(k))|（即|f(x(1))|<|f(x(0))|)，然后更新下山因子为u=1,继续以牛顿法迭代。(MATLAB Newton-down a small program, the principle is not explained in detail. Newton iteration by the initial value of the selected limit, in order to prevent additional iterative divergence, the iterative process a request: | f (x (k+1)) | < | f (x (k)) | Newton iteration Results: x (k+1) ' = X (k)-f (x (k))/f' (x (k)) and a previous approximation x (k), appropriately weighted average as a new improved value: x (k+1 ) = u* x (k+1) ' + (1-u)* x (k), where u (0 < u> iteration take successive calculated at 50 until the additional requirements found so far. examples of calculation of X ( k) = x (0) unchanged profile u and x (k+1, hungry) until: | f (x (k+1)) | < | f (x (k)) | (i.e. | f (x (1)) | < | f (x (0)) |), then profile downhill factor for u = 1, to continue to Newton iteration.)