lssvmprediction

说明：  工艺优化中偏最小二乘法对响应面法的改进，显著改善模型系数不显著现象(Matlab program for calculating grey correlation matrix)

计算离散傅里叶变换的一种快速算法，简称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.)

最高用水量时，给水管网平差程序，c语言开发，含实例演示(When the maximum water consumption, water distribution network adjustment program, c language development, with examples demonstrate)

分支界限费用矩阵的说明文档，非常实用,建议下载哦(Branch line cost matrix documentation, very practical, it is recommended to download Oh)

说明：  通过建立截面为多边形的水平柱体模型，运用c语言程序进行编程，得出该地质体的重磁异常特点(By establishing a horizontal cylinder model with polygon cross section and programming with C language, the characteristics of gravity and magnetic anomalies of the geological body are obtained.)

cluster in quest聚类算法是基于密度和网格的聚类算法。对于大型数据库的高维数据聚类集合。(cluster in quest clustering algorithm is based on the density of the grid and clustering algorithm. For large database of high-dimensional data clustering pool.)

序列二次规划(SQP)方法被认为是解决非线性约束优化最有效的方法之一，传统的SQP算法每一步迭代都要求解QP子问题。 　　(Sequential two times programming (SQP) is considered to be one of the most effective ways to solve nonlinear constrained optimization. The traditional SQP algorithm requires QP iteration for every iteration.)

求解声学问题的边界元程序，给声学研究的人员很大启发(Solving the problem of acoustic boundary element program, to inspire great acoustic research staff)

地统计学中的克里格插值法，Matlab编写，内有详细的说明。(failed to translate)

计算离散傅里叶变换的一种快速算法，简称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.)