Computational-Science-codes

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

是CA算法的test程序，用于描述微观枝晶长大的代码！(CA algorithm is the test procedure, used to describe the micro-dendrites grew up in the code!)

最小二乘法拟合曲线C++代码，任意的M个数据，任意的次数N(N不易太高)。输出拟合曲线的表达式(Least Squre For ...)

this is fft header file for fast fourier transform. with this file, you can compute frequency spectrum zero to tow pi.

随机数生成程序，该随机数呈zipf分布，就是大家常说对于内容的访问遵循80/20原则，也就是20 的内容，会占有80 的访问量。(Random number generator, the zipf was distributed random numbers, that is, we often say that the access to the content to follow the 80/20 principle, which is 20 of the content will occupy 80 of visits.)

8.1 最小二乘曲线拟合hpir1.c 8.2 切比雪夫曲线拟合hchir.c 8.3 最佳一致逼近的里米兹法hremz.c 8.4 矩形域的最小二乘曲面拟合hpir2.c(8.1 Least-squares curve-fitting hpir1.c 8.2 Chebyshev curve fitting the best uniform approximation hchir.c 8.3 years Meeds law hremz.c 8.4 rectangular domain least-squares surface fitting hpir2.c)

CT迭代重建算法中3维投影矩阵的生成算法，该算法对学习计算机断层层析成像很有帮助。(CT image reconstruction projection ,3D)

内插高程点，CASS不提供插求高程点功能，我们手工输入容易出错，且极度不方便，。 此程序用VBA编写，界面操作，按设定的比例自动计算需内插的个数并注记。(Interpolated elevation points)

FFT/IFFT 变换程序----------------(FFT/IFFT transformation process----------------)

说明：  曲线的三次样条插值，在非首尾节点处具有三次光滑性质(Curve cubic spline interpolation, in both nodes with non-smooth nature of the three)