牛顿迭代法求解非线性方程组

滚动轴承信号的保罗谱分析，hilbert Teager能量算子，信号平方，信号取绝对值等等方法求信号包络谱(hilbert transmission)

利用QS4算法解决N皇后问题，解决300万的皇后所需时间在5s左右，特别快(Use QS4 algorithm to solve the N-queens problem, solve 3000000 Queen the time required for about 5s, particularly fast)

利用矩阵法求解对策论中的二元零和博弈最优策略(Game theory using matrix method for solving binary zero-sum game in the optimal strategy)

用于生成空气动力学力学计算中的计算O型网格(generate the calculational grid)

该代码完成了LM算法，并附有详细的代码说明。(The code completion LM algorithm, along with a detailed code instructions.)

用fortran语言编写的传统矩量法求解立方体的RCS的程序。(The fortran language prepared by the traditional method of moments for solving the cube RCS program.)

计算方法实验，通过编程实现埃特金加速法，一般迭代法，牛顿法的收敛次数的计算(calculated experiment, Programming Aitken acceleration method, the general iterative method, the convergence of Newton's method of calculating the number of)

蒙特卡洛资料，对于编写概率计算问题有较多的帮助，希望能帮到需要的人。(Monte Carlo)

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.)

说明：  介绍线性算子的基本概念的文章,这是书里面的一个章节(Foundation of linear operator theory)