Pattern_recognition1

通过标准方法实现结构加速度的线性积分问题(Implementation structure by standard methods of linear integral of acceleration)

共轭梯度法（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)

三维重力梯度正演程序，可根据剖分模型计算多个场分量，绝对原创！(3D Gravity Gradients calculating )

齐民友的重温微积分，通俗易懂的经典数学书籍。 (Naritami revisit the Friends of calculus, a classic user-friendly math book.)

这是ansys里面apdl语言，用于计算圆柱体开裂(This is the ansys inside apdl language, used for calculating the cylinder craze)

数学建模,很简单的，希望对你们用帮助，望下载！(Mathematical Modeling)

重力异常正演代码，请好好使用它。帮助学习。。。。(Gravity anomaly forward code, please use it well. Help learn)

该程序用于瞬变电磁勘探近区场计算，只要输入不同参数便可以得到近区场的视电阻率(The procedure transient electromagnetic exploration for near field calculations, as long as the input parameters can be different near field apparent resistivity)

说明：  共轭梯度法求解线性方程组,主要采用FR共轭梯度法(solve liner solutions from CG)

hartigans Sequential Leader Clustering Algorithm in terms of OpenCV (ver.1.1) Sequential Leader algorithm: Hartigan, J. A. (1975), Clustering Algorithms. John Wiley and Sons, Inc., New York, NY. 1. Select maximum cluster "radius" 2. Start with zero clusters 3. Add each item to be clustered to: * Closest cluster if distance <= r * New cluster if distance to closest cluster > r 4. Compute new center from members in cluster 5. Empty the clusters (keeping the centers) 6. Return to step 3 (until no changes are made)