1

一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数n和约束条件个数m较大时，单纯形法是求解线性规划问题的通用方法。 从线性方程组找出一个个的单纯形，每一个单纯形可以求得一组解，然后再判断该解使目标函数值是增大还是变小了，决定下一步选择的单纯形。通过优化迭代，直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems. Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)

该程序通过编写fortran，得到abaqus之程序usdfld，并实例分析。(The program is by writing fortran, get abaqus procedures usdfld, and case analysis.)

TGM.m \传统的Galerkin方法 MD.m \时滞惯性流形方法 brownian.m \演示布朗运动 randomwalk.m \ 演示随机游走 tumor.m \ 演示tumor演化(TGM.m traditional Galerkin method MD.m Delays inertial manifold method brownian.m demo Brownian motion randomwalk.m demo random walk tumor.m demo tumor evolution)

t_tide潮流分离更新新版本。可以针对潮汐与海流进行有针对性分离。(t_tide trend separation to update the new version. Targeted separation for tides and currents.)

matlab的时频分析工具箱，含全部工具箱程序(Matlab time-frequency analysis toolbox, including all toolbox programs)

This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector] - vector N (real) To compile: ICC KMEANS.CPP <enter> (This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen. Usage for KMEANS is: KMEANS SOURCEFILE <enter> The format of the source file is: NPat - Number of patterns (int) SizeVect - Size of vector (int) NClust - Number of cluster centers(int) vect[1,1] ... vect[1,SizeVect] - vector 1 (real) vect[2,1] ... vect[2,SizeVect] - vector 2 (real) . . . . . . vect[NPat,1] ... vect[NClust,SizeVector]- vector N (real) To compile: ICC KMEANS.CPP <enter> )

利用五点差分格式和Jacobi迭代法，求解精确解和数值解的误差，判断阶数是否正确(Five-point difference scheme and Jacobi iteration method are used to solve the error between exact solution and numerical solution and to judge whether the order is correct or not.)

此程序用于计算圆形截面的弯矩曲率特性和不同极限状态的识别(This program used for the the moment curvature calculation of circular cross-section characteristics and different limit state identification)

语音信号滤波程序（低通、带通、多带通、fft卷积滤波 自己动手做的(Voice signal filtering process (low-pass, band-pass, multi-band-pass, fft convolution filtering)

说明：  最小二乘法寻找最佳函数匹配，用以数值计算，优化曲线(The least square method is used to find the best function matching for numerical calculation and curve optimization.)