FFT

说明：  FFT（Fast Fourier Transformation）是离散傅氏变换（DFT）的快速算法 [1] 。即为快速傅氏变换。它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。(FFT (Fast Fourier Transform) is a fast algorithm of discrete Fourier Transform (DFT). That is fast Fourier transform. According to the odd, even, imaginary and real characteristics of discrete Fourier transform, the algorithm of discrete Fourier transform is improved.)

程序用Fortran95标准，给出了双共轭梯度法求解超大型稀疏矩阵的子程序。还给出了一个例子，例子的数据用索引存储了维数将近10万的对称稀疏正定矩阵。(Using Fortran95, a method of Biconjugate gradient for super linear sysem is provied. In addition, a example with the storage type of row-column index is also provide for test these subroutines. )

用于处理电力系统中含有4个节点的随机潮流计算(Four nodes to deal with the random flow calculation)

《矩阵论导教.导学.导考》。是程云鹏《矩阵论》的课后习题答案与复习题纲()

说明：  点云通过不同的多项式来进行曲线拟合，可以手动设置多项式的次数。(Point clouds are fitted by different polynomials,The degree of the polynomial can be set manually.)

分数阶fourier变换程序，基于插值和抽取操作和卷积运算的快速算法。(Fractional fourier transform procedures, based on interpolation and extraction operation and fast algorithm for convolution operation.)

复数的四则运算完整版，包括加减乘除，阶乘，开方等。。。(The plural arithmetic full version,, including addition, subtraction, multiplication, and division factorial, prescribing, etc...)

多变量自回归模型matlab源码，可以简单方便地计算多变量自回归模型系数，谱结构等(multivariate autoregressive models)

说明：  数值分析 显示算法 非线弹性 滞回曲线(Numerical analysis showed that the algorithm the linear elastic hysteresis curve)

说明：  Copula and tail dependence