3803

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

平常练习的一些程序，比较基础，包括求斐波那契数、完数等等(Some of the usual practice procedures, more infrastructure, including seeking Fibonacci numbers, number, etc. End)

LM3S例程系列，非常实用。 代码稍加修改即可使用。(LM3S routine series, very practical. The code is slightly modified can be used.)

工程领域，PR方程代码.用于计算混合工质性质。(PR equation code)

高斯-赛德尔迭代法是解线性方程组的常规算法，本文是C语言的高斯-赛德尔计算代码(Gauss-Seidel C program)

求解KZK方程的VISUAL C++源代码 具有计算速度快，计算精度高等优点。(source code solution of KZK equation visual c++)

盒维数计算和豪斯多夫维数的计算与应用研究程序(box counting)

21位水仙花数的寻找，里面用到了大数乘法等细节上的东西。(find the 21 digits narcissus.)

弗洛伊德算法最短距离的实现，输入为邻接矩阵，输出为最短距离矩阵。(Freud' s realization of the algorithm for the shortest distance, enter the adjacency matrix output for the shortest distance matrix.)

针对传统的算法如遗传算法、粒子群算法等在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.)