Tower-of-Hanoi-problem

说明：  VUMAT for Kinematic Hardening Plasticity

甲烷的19步简化反应机理文件，FORTRAN语言编写反应速度(ch4 reaction rate)

new robot search algorithms

多机电力系统仿真及其潮流计算，图像的光流法计算的matlab程序,与理论分析结果相比。( Multi-machine power system simulation and flow calculation, Image optical flow calculation matlab program, Compared with the results of theoretical analysis.)

数值分析算法，该压缩包含有雅克比迭代算法、弦割法法及综合评测法等(Numerical analysis algorithms, the compression Jacobi iteration algorithm, France and France chord cutting and comprehensive evaluation method)

说明：  共轭梯度法（Conjugate Gradient）是介于最速下降法与牛顿法之间的一个方法，它仅需利用一阶导数信息，但克服了最速下降法收敛慢的缺点，又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点，共轭梯度法不仅是解决大型线性方程组最有用的方法之一，也是解大型非线性最优化最有效的算法之一。 在各种优化算法中，共轭梯度法是非常重要的一种。其优点是所需存储量小，具有步收敛性，稳定性高，而且不需要任何外来参数。(Conjugate gradient method Gradient) is a method between the steepest descent method and Newton's method. It only uses the first derivative information, but overcomes the disadvantage of slow convergence of steepest descent method, and avoids the disadvantage of storing and calculating Hesse matrix and solving inverse of Newton's method. Conjugate gradient method is not only one of the most useful methods to solve large-scale linear equations, but also the most effective method to solve large-scale nonlinear optimization One of the algorithms of. Among all kinds of optimization algorithms, conjugate gradient method is very important. It has the advantages of small storage, step convergence, high stability and no external parameters.)

数值分析中用C 语言验证验证Gauss列主元消去法。(Numerical analysis using the C language to verify verify the Gauss column principal component elimination.)

用于焊接模拟的fluent的双椭球体热源UDF程序。(For welding simulation fluent double ellipsoid heat source UDF program.)

说明：  这是简绍耦合矩阵的，为多通带的计算方法，可以方便的设计多通带微带滤波器，(This is Jane Shao coupling matrix for the multi-band calculation method, you can easily design multi-band microstrip filter)

反密法在数值计算中的地位就不用我来一一列举了，此程序就可以轻易的使其实现。(anti-secret numerical calculation method in the position I would not have to list them one by one, this procedure can easily achieve it.)