四面体单元

Matlab 算法寻找Bessel函数的零点。(find the zero point of Bessel functions)

Matlab求解微分方程组，几种经典算法(MATLAB Solves Differential Equations, Several Classical Algorithms)

比较JPLDE405的切比雪夫系数导出的位置与低精度月球坐标分析。(Comparative Analysis of JPL DE405 cut Chebyshev coefficients derived position with low accuracy lunar coordinates.)

说明：  三次样条插值的MATLAB程序（三弯矩方程）(Cubic Spline Interpolation MATLAB (3 Moment equation))

矩阵的练习 对于掌握数组的 概念很重要。如何快速掌握数组，灵活运用。(The practice of the matrix is ​ ​ very important to grasp the concept of the array. How to quickly grasp the array of flexible use.)

它是一个计算热通量的c++程序，用udf导入fluent，既可以求解，非常好用的一个，可以作为入门的一个例子学习。(it is a calculated heat flux of c++ program, with udf into fluent, not only can solve, very easy to use one, can be used as a case study entry.)

对于方程组AX=b，当系数矩阵非奇异时，对原方程进行改写，利用公式X^k=BX^(k+1)+g进行迭代求解。(For equations AX = b, when the coefficient matrix is ​ ​ nonsingular, rewriting the original equation, using the formula X ^ k = BX ^ (k+1)+g for iterative solution.)

自己编写的关于水声实验插值的程序，给大家借鉴一下。(I have written on the underwater acoustic experiments interpolation procedure, we learn from you.)

说明：  文件中有大量 数据样本，根据样本进行数据处理，求均值，插值，最大值，最小值等(There are a large number of data samples in the file. According to the samples, data processing is carried out to find the mean value, interpolation, maximum value, minimum value, etc)

计算离散傅里叶变换的一种快速算法，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。(A computing discrete Fourier transform fast algorithm, referred to as FFT. Fast Fourier Transform in 1965 by the JW Cooley and TW Tuji Ti out. Using this algorithm enables a computer to calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.)