kriging

有直接法,间接法,Bartlett法,Welch法(有????? ????? Bartlett ? Welch )

采用贝叶斯推论的数据融合，将CHAN算法和泰勒算法的结结果经过处理，得到更好的定位结果，已通过测试。 (Bayesian inference using the data fusion, will CHAN Taylor algorithm and the results of algorrithm processed and better positioning of the results of the full source code, has been tested. )

最速下降法就是梯度下降法,可以用于求解最小二乘问题(线性和非线性都可以)。可以说是求解机器算法的最古老、最经典的模型，另一种常用的方法是最小二乘法。(The steepest descent method is the gradient descent method, which can be used to solve the least squares problem (both linear and non-linear). It can be said that it is the oldest and most classical model for solving machine algorithm. Another commonly used method is the least square method.)

打靶法求微分方程边值问题，这是数学上的求取方程问题的边值的方法 (Shooting method for boundary value problems for differential equations, which is to strike a mathematical equation of the boundary value problem approach)

ABAQUS扩展子程序开发，用于计算模拟(ABAQUS extended subroutine application)

最小二乘估值的SVD分解计算方法，本程序可将最小二乘估值问题转化为超定方程组的问题处理，且可用奇异值分解的方法计算最小二乘问题。(Least Squares Estimates of the SVD decomposition method, the valuation process can be transformed into squares overdetermined equations deal with the problem, and can be calculated singular value decomposition least squares problem.)

牛顿插值算法，利用数组存储均差表，一步步迭代求得插值(Newton interpolation algorithm, the use of array stores are differential gauge, step by step, iterative get interpolation )

计算矢量拉盖尔高斯光束中古伊相移产生的角衍射，及其与能流分布的关系。(The Poynting vector)

滤波程序，从同事那里要的，大家一起交流学习(BADNELL & BURGESS D.A.M.T.P. CAMBRIDGE C C DIAGONALIZATION OF REAL SYMMETRIC N-BY-N MATRIX Z. C C METHOD: HOUSEHOLDER REDUCTION TO TRI-DIAGONAL FORM AND SHIFTED C QL ALGORITHM TO DETERMINE THE E-VALUES AND E-VECTORS. C C BASED ON MARTIN, REINSCH & WILKINSON: NUM. MATH. 11, 181-95 (1968). C C INPUT REQUIRED. N, IUP AND Z. ONLY LOWER TRIANGLE OF Z NEED BE SUPPLIED. C MATRIX Z OVERWRITTEN BY EIGENVECTORS OF Z. C IUP=1/-1 ASC/DESCENDING SORT, 0 NO SORT. C MXMAT, IS THE ROW DIMENSION OF Z IN THE CALLING ROUTINE. C C OUTPUT. Z AND D, WHERE Z CONSISTS OF COLUMN EIGENVECTORS C AND D CONSISTS OF CORRESPONDING EIGENVALUES. C C NOTE: E IS A WORKING ARRAY. C)

bellman-ford算法，典型最短路算法，用于计算一个节点到其他所有节点的最短路径(bellman-ford algorithm, a typical shortest path algorithm for computing a node to all other nodes of the shortest path)