algorithms(CPP)

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

C++实现的FFT，详细，简单，内含多个测试类(using C++ implements fft，including serials class)

用计算机编程的方法建立试卷的合理分配问题的优化模型(Optimization model to establish the papers a reasonable allocation problem with computer programming methods)

c/C++跟fortran语言之间的一些转换(c/C fortran language with the conversion between)

在VS2005环境下，使用CUDA编程实现SAR成像中CSA算法的实现，得到了很好的加速比。(In the VS2005 environment, using the CUDA programming SAR imaging algorithm implementation in the CSA, has been very good speedup.)

响应面方法的一个例子，二阶响应面，使用正交矩阵法求解(rsm algorithms )

艾特金迭代法求解线性方程组源代码，在程序中修改方程就可以(Aitkin iterative method for solving linear equations source code, the equation can be modified in the program)

合肥工业大学数值分析（计算方法A）中高斯—塞德尔算法的实现(Gauss- Seidel Algorithm)

说明：  平面问题的有限元基础，大家可以参考一下学习学习(The finite element foundation of the plane problem, you can refer to it)

判断点和线段之间的关系，包括点在线段的上，点在线段的延长线，反向延长线，点在线段外四种情况(Judge the relationship between the point and line, including the point on the line, in line at the extension of reverse extension cord, and so on.)