SIMPLE

PoleyFitqw曲3线3拟w合类q库 PolewyFitqw曲w线拟w合t类库 PoelywFitq曲w线拟t合类t库 PoelyFtitq曲er线rw合类t库 PolywrFitq曲q线拟wt合t类库(Pwoly33FiwtPoleetPwolyFit555PolywFit)

利用遗忘因子递推最小二乘法做的参数估计，介绍还算详尽(Forgetting factor recursive least squares method using the parameter estimates do)

Dsimplex.m 对偶单纯形法求解线性规划问题(Dual simplex method for solving linear programming problems)

非圆形离散元程序，通过采用非圆形颗粒实现康转动性能(Non-circular discrete element program, through the use of non-spherical particles achieve Kang rotation capability)

可用于层次分析法比较评价，主函数输入初始矩阵，调用层次分析函数(It can be used for comparative evaluation of analytic hierarchy process. The main function input the initial matrix and call the analytic hierarchy process function.)

一维热传导模型，一维稳态热传导模型，有限差分法(One dimensional heat conduction model)

基于内点法的最优潮流计算，跟踪中心轨迹内点法最优潮流程序 实现了有功损耗最小的经济分配。(Optimal power flow calculation based on interior point method, the point-of-flight optimal power flow program in the tracking center trajectory achieves the economic distribution with the least active loss.)

说明：  复合材料单向板损伤模拟的Umat子程序，配合ABAQUS进行损伤模拟。(A umat subroutine for the simulation of composite meterials damage.)

多孔介质流动程序，基于Shan-Chen模型，使用格子玻尔兹曼理论(Multi-component fluid, using a LB method,based on the Shan-Chen model)

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