9.2.2

说明：  实现快速离散傅里叶变换，即FFT,很有用的程序(Fast discrete Fourier transform, namely, FFT, very useful program)

研究典型相关分析的各种线性算法和非线性算法，并通过实验数据的比较说明了它们各自的特点(Canonical Correlation Analysis Study of the various linear and nonlinear algorithms algorithms, and through comparison of experimental data shows the characteristics of their respective)

适用于大型稀疏矩阵 矩阵转置 c语言 来自于有限元方法编程(From the finite element method suitable for large-scale sparse matrix matrix transpose c language programming)

说明：  神经网络算法，希望能对大家有点点帮助，可以相互交流(Neural network algorithm, I hope everyone can have little bit of help, they communicate with each other)

说明：  埃特金不等距插值，有例子，检验过，很顺利(Aitken non-equidistant interpolation, there are examples of tests, it is smooth)

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

计算方法程序:多项式拟合(Calculation procedure: Polynomial Fitting)

四阶龙格库塔法 数值计算 C++源码 可直接运行(Fourth-order Runge-Kutta numerical method C++ source code can be run directly)

计算复序列的分裂基快速傅里叶变换，分裂基快速算法是将基2和基4分解组合而成。在基2M类快速算法中，分裂基算法具有最少的运算量，且仍保留结构规则、原位计算等优点。(Calculate complex sequence of split radix fast Fourier transform, fast algorithm is to split the base base 2 and base 4 decomposition combination. 2M fast algorithm in the base class, the split-based algorithm has the least amount of computation and structural rules remain in situ calculation and so on.)

实现多项式相乘求模运算，并且模多项式是可以改变的，方便，简单(To achieve polynomial multiplication modulo operation, and polynomial model can be changed, convenient and simple)