Douglas_Peucker

系统辨识与自适应Matlab仿真程序 庞中华，崔红 编著(Matlab CODE)

随机调制信号下的模拟ppm，连续相位调制信号(CPM)产生，供做算法研究人员参考。( Random ppm modulated analog signal under Continuous phase modulation signal (CPM) to produce, Algorithm for researchers to do reference.)

采用四阶龙格库塔方法进行微分方程解算,用matlab编写的源代码,主要用于四元素微分方程的实时解算(Using fourth-order Runge-Kutta methods for differential equation solvers, prepared to use matlab source code, mainly for the four elements of real-time differential equation solver)

converts binary sequence to decimal sequence

实现位场数据的向上延拓运算，有效的消除数据中的噪音及浅部干扰。(Realize the potential field data upward continuation operator, effectively eliminate the noise in the data and shallow interference.)

This is a Stack Class with Funtions Push,Pop, check Stack is Full or Empty Application: Change a number from Decimal to Binary

岩石损伤与断裂力学一直是有限元的弱势领域，必须依赖MATLAB一类的数学软件协助，本书籍提供了基础教程与相关案例。(Rock damage and fracture mechanics have been the weak field of finite element, must rely on MATLAB class of mathematical software to help, this book provides basic tutorials and related cases.)

abaqus子程序学习资料，欢迎大家下载学习，共同讨论~(ABAQUS subroutine learning materials)

世界上开源的速度最快的FFT变换程序FFTW的说明文档，搜集了好久才找到，都是中文的，有助于对FFTW的使用。(Open source in the world s fastest FFTW FFT transform program documentation, gathered for a long time to find, are all in Chinese, help to the use of FFTW.)

一般线性规划问题具有线性方程组的变量数大于方程个数，这时会有不定的解。当决策变量个数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.)