MOM

用吉尔方法积分一阶微分方程组的初值问题。(Gill method with integral equations of first order initial value problem.)

其基本思想是取B样条函数 为及基函数，在[a,b]中均匀划分区间，xi=a+ih,h=(b-a)/n,由于三次样条函数空间是n+3维的，所以把分点扩充到x-1,xn+1,则任意三次样条函数可用 线性组合来表示：(The basic idea is to take B-spline function and basis functions in [a, b] in the evenly divided intervals, xi = a+ ih, h = (ba)/n, because the cubic spline function is n+3 dimensional space , so the expansion points to the x-1, xn+1, then any cubic spline function can be expressed as a linear combination:)

基二、基四、基八 FFT变化源代码，有详细注解(Second base, the base four or eight FFT-based changes in the source code, detailed comments)

frft程序函数，分数阶傅立叶变换，短时傅立叶变换，傅立叶变换(the frft program function, fractional Fourier transform, short-time Fourier transform, Fourier transform)

在Z2[X]中判断一个多项式是否本原多项式，并能对给定的多项式求逆。 (in Z2 [X] to judge whether a polynomial primitive polynomial, and the right to the inverse polynomials.)

主要是关于一些数值计算中所要用到的头文件,希望对大家有所帮助(Mainly on the number of numerical calculation by the use of header files, I hope all of you to help)

对平面上给定的多点进行多项式曲线的拟合，可设置拟合多项式的次数(Given more points on the plane polynomial curve fitting, you can set the number of polynomial fitting)

打靶法求解两点边值问题 实例测试通过，可直接运行，并带有详细代码注释 采用全局收敛的牛顿-拉普森迭代算法求解编制问题 绝对物超所值！(Two-point boundary value problem shooting method)

c语言程序编写在经验模态分解，包含三次样条(c language programming in the empirical mode decomposition, contains the cubic spline)

实现1到1000位的大数运算（包括加减乘除和浮点数运算），运行环境是vs2005(1-1000, large number operations (addition, subtraction and floating-point), the operating environment is vs2005)