FFTOcean

可进行最小二乘法线性拟合输出，包含源代码及生成后的程序(Least-squares linear fit can be output)

经典矩阵运算问题求解(classic problem solving matrix operations)

针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足，本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化，并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率，提高解的精确，同时还保持了较低的计算复杂度，具有良好的稳健性。(TSP problem solving for the traditional algorithms such as genetic algorithms, particle swarm optimization accuracy and solving the scale, there is a certain lack of a dynamic programming algorithm-based particle swarm optimization algorithm. The algorithm using dynamic programming method to achieve the evolution of information exchange between the particles and the particles, and particle swarm particle scale-free information guide network topology map to connect. The simulation results show that this method can effectively reduce the error rate and improve the solution precision, while maintaining a low computational complexity, good soundness.)

用于求解线性方程组的追赶法！！！程序经过优化处理，运行速度快，且注释完全易于阅读，欢迎大家下载！！(Solving linear equations for the law to catch up! ! ! Optimized procedures to deal with, fast, and completely easy-to-read notes, welcome you to download! !)

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

An example of using a matrix object in order to pass values and complete a function.

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

说明：  用C语言编写多元线性回归方程，写得不好的地方请指教！(Using C language multiple linear regression equation, where poorly written, please advice!)

单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是：线性规划问题的可行域是 n维向量空间Rn中的多面凸集，其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是：先找出一个基本可行解，对它进行鉴别，看是否是最优解；若不是，则按照一定法则转换到另一改进的基本可行解,再鉴别；若仍不是，则再转换,按此重复进行。因基本可行解的个数有限，故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。 (Simplex method for the minimum)

极小 算法（Min-Min）、极大极小算法(Max-Min)、最大时间跨度算法（Max-Int）三种典型的映射算法的算法原理以及计算程序(Minimal algorithm (Min-Min), max-min algorithm (Max-Min), maximum time-span algorithm (Max-Int) three typical mapping algorithm and the algorithm of the calculation program)