matlab计算代码

混合高斯模型 对于给定的数据，可以自动选择最佳聚类数目和聚类中心，并根据判决规则进行收敛，运算很快，非常方便(Mixed-Gaussian model for a given data, can automatically select the best cluster number and cluster centers, and in accordance with decision rules convergence, compute very fast, very convenient)

最小二乘法和支持向量回归机相结合无线传感网络节点定位的源码.(The source of The least squares and support vector regression combining wireless sensor network node positioning . )

Matlab code FDTD 2D ( dennis sullivan book )

计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)

说明：  基于M估计的迭代最小二乘算法，其中估计量有Huber,Andrews,Hampel,Ramsay等。(M is estimated based on the iterative least-squares algorithm, which estimates there are Huber, Andrews, Hampel, Ramsay and so on.)

应用牛顿法的直角坐标系下的33节点潮流计算(33 node flow calculation)

糊涂先生给他的五个朋友写信，他写了五封信，但是当他的朋友收到信后，都告诉他：“你的信寄错了”。那么请你计算一下：出现这种情况的概率有多少？（假设糊涂先生是随机地往信封里装信的），你能不能把所有的情况都列出来呢(Mr. foolish to write him five friends, he wrote five letters, but when his friend received a letter, told him: )

牛顿法测试程序，包含线搜索和不含线搜索时算法比较。(newton algorithm with linear and without linear search.)

输出三维数据可供tecplot软件读取的二进制文件(Output data for three-dimensional software to read the binary file tecplot)

说明：  模糊指数平滑算法源程序,进行预测 计算.(fuzzy exponential smoothing algorithm source for projection.)