牛顿迭代解非线性

模糊数学中典型的卡车倒车入库模拟仿真程序，充分利用了一定的经典的模糊规则，来实现卡车倒车的模拟(typical truck reversing the arsenal of simulation procedures and make full use of a certain classic fuzzy rules to achieve the reversal of simulated truck)

程序计算在声速梯度下水中声线的传播并计算声线的长度(Program calculates the velocity gradient in the water line of acoustic sound propagation and calculate the length of the line)

克里金(Kriging)插值法又称空间自协方差最佳插值法，它是以南非矿业工程师D．G．Krige的名字命名的一种最优内插法。克里金法广泛地应用于地下水模拟、土壤制图等领域，是一种很有用的地质统计格网化方法。它首先考虑的是空间属性在空间位置上的变异分布．(Kringing smooth)

说明：  求解黎曼问题格式Roe格式FORTRAN编程(Solution of Riemannian problem format roe format FORTRAN programming)

以上是两个内点法程序，原仿射内点法，对偶仿射内点法。初始内点需要自己给出，自动求解初始内点的程序下次发送(These are the two interior point method procedure, the original affine interior point method, dual affine interior point method. Initial interior point needs its own given the initial interior point solution of automatic procedures to send the next)

说明：  蚁群算法优化随机共振参数，用于滚动轴承故障诊断(Ant colony optimization stochastic resonance parameters, bearing fault diagnosis)

说明：  umat公式详细介绍，我也不知道够20字了mei(the introduction of umat in abaqus)

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

有限元方法fortran编程，包括二维三维线性非线性静态分析、稳定流瞬时流分析、振动问题、特征值问题、并行计算等。包含了所有子程序。(Finite element method fortran programming, including 2D and 3D linear and nonlinear static analysis, steady flow transient flow analysis, vibration problems, eigenvalue problems, parallel computing. Contains all subroutines.)

Finding special triples of the form (n, n + 1, n + 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n + 1, n + 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.(Finding special triples of the form (n, n+ 1, n+ 2) Write a program that finds all triples of consecutive positive three-digit integers each of which is the sum of two squares, that is, all triples of the form (n, n+ 1, n+ 2) such that: • n, n+1 and n+2 are integers at least equal to 100 and at most equal to 999 • eachofn,n+1andn+2isoftheforma2+b2.)