SVD

3D流场计算，程序简单非常容易看懂。适合初学者学习(3D flow field)

说明：  任意边界结构正交曲线网格生成程序，使用方便简单(Arbitrary boundary structure of orthogonal curvilinear grid generation procedure, easy to use simple)

金属材料的随动强化有限元模型，适用于有限元分析的本构模型二次开发(Finite element model of kinematic hardening of metallic materials, constitutive model suitable for finite element analysis of secondary development)

用C语言实现计算两个数字的最大公约数，代码简单简洁，适合初学者学习。(C language is used to calculate the maximum common divisor of two digits. The code is simple and concise. It is suitable for beginners to learn.)

The only information passed from difeq to solvde is the matrix of derivatives

说明：  基于M估计的迭代最小二乘算法，其中估计量有Huber,Andrews,Hampel,Ramsay等。(M is estimated based on the iterative least-squares algorithm, which estimates there are Huber, Andrews, Hampel, Ramsay and so on.)

共轭梯度法（Conjugate Gradient）是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一(Conjugate gradient method (Conjugate Gradient) is between the steepest descent method and Newton' s method between a method that takes only a first derivative information, but to overcome the slow convergence of the steepest descent method shortcomings, but also avoid the need to store Newton and computing the inverse Hesse matrix and disadvantages, conjugate gradient method is not only to solve large linear equations of the most useful methods, large-scale nonlinear optimization solution is the most efficient algorithms)

算法优化非常好，几乎没有循环，Relief计算分类权重，包括四元数的各种计算。( Algorithm optimization is very good, almost no circulation, Relief computing classification weight, Including quaternion various calculations.)

很好的东西，关于用卡尔曼算法做对消算法的...(Good things Kalman algorithm cancellation algorithm ...)

有效集法利用数学规划的对偶理论,将所求双层规划转化为一个下层只有一个无约束凸二次子规划的双层规划问题.然后根据两个双层规划的最优解和最优目标值之间的关系,提出一种简单有效的算法来解决非增值型凸二次双层规划问题.(Quadratic Bilevel Programming 　)