random

罚函数法 它将有约束最优化问题转化为求解无约束最优化问题: 其中M为足够大的正数, 起"惩罚"作用, 称之为罚因子, F(x, M )称为罚函数.(hunhefahanshufa)

随机数的产生，枚举嵌套算法求解一元多次方程。按批量处理。(The generation of random Numbers, nested enumeration algorithm monadic equation according to the batch processing for many times)

高斯正算坐标程序计算高斯投影的正算问题克拉索夫斯基椭球(Gaussian count is calculated coordinates of the Gaussian projection is counting police used batons for dispersing ellipsoid)

说明：  虽然现在网上的FFT程序很多，但是有的结果是错误的，比如说，经过一次正反变换后，不能得到原来的数列，所以，本人测试了多个程序，提供几个能用的，给大家，希望大家支持！ (Although many online FFT program, but some results are wrong, for example, through a positive and negative change, you can not get the original series, so I tested several programs to provide a few usable for everyone I hope we can support!)

说明：  包含马尔可夫预测、贝叶斯决策、模糊聚类分析、模糊综合评价方法等多种计算方法(Including Markov prediction, Bayesian decision-making, fuzzy clustering analysis, fuzzy comprehensive evaluation and other calculation methods)

《高等计算力学》教材的源程序,非线性有限元计算程序(" Advanced Computational Mechanics" of the source material)

主要是基于mtlab的程序，在matlab环境中自动识别连通区域的大小,pwm整流器的建模仿真。( Mainly based on the mtlab procedures, Automatic identification in the matlab environment the size of the connected area, Modeling and simulation pwm rectifie.)

共轭梯度法（Conjugate Gradient）是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一。 在各种优化算法中，共轭梯度法是非常重要的一种。其优点是所需存储量小，具有步收敛性，稳定性高，而且不需要任何外来参数。(Conjugate gradient method (Conjugate Gradient) is between the steepest descent method between the method and Newton' s method, it takes only a first derivative information, but to overcome the steepest descent method convergence slow shortcomings, but also to avoid the Newton method needs to be stored Hesse and disadvantages of computing inverse matrix and the conjugate gradient method is not only one of the most useful methods to solve large linear equations, solution of large-scale nonlinear optimization is one of the most effective algorithm. In various optimization algorithm, conjugate gradient method is a very important one. The advantage is that a small amount of memory required, with step convergence, high stability, and does not require any external parameters.)

基于GWBASIC实现的无约束寻优算法，内附GWBASIC主程序和说明(Non-binding on GWBASIC achieve optimization algorithm, the main program and instructions included GWBASIC)

三次样条曲线拟合代码，先训练，后差值，计算非常准确(Three times spline curve fitting, the first training, and after, computation is very accurate)