Workshop7

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

本程序是用数学方程试计算出一个点在一条线上的垂线坐标，并判断出在线内外，是测量中用的程序！(The test procedure is used to calculate the mathematical equation of a line a point in the vertical coordinate, and determine the line outside, the procedure used to measure!)

优化设计算法：用powell法求解目标函数的最优解和最优值，已经验证算法的正确性，在visual c++6.0下开发(Optimization algorithm: Solving the objective function with powell optimal solution and optimal value, has verified the correctness of the algorithm, the visual c++6.0 under development)

自己写了一个二维Euler方程的间断有限元程序 上次发了一个三角形单元的程序 因为不是曲边单元 所以在圆柱后面容易形成涡 现在把程序改为曲边四边形单元了 没有涡出现 单元是8节点四边形单元 节点编号顺序是 1 5 2 6 3 7 4 8 也就是四个角点依次 是1 2 3 4 然后是边的中点编号 5 6 7 8. 时间推进采用 Runge-Kutta 方法 数值通量采用全局Lax-Friedrichs通量 仍然不能捕捉激波 因为没有做重构或者加人工粘性 等这个做出来了 再发一次。 程序没有进行优化 比如说内存的消耗没有优化 比如直边单元的边界积分仍然采 用了曲边的积分方法 增加了计算量 比如面积分、线积分都是采用的是Gauss- Legendre-Lobatto积分 积分精度会比一般的Gauss-Legendre积分精度低一阶 等 等问题。 二维的 纯属交流性质 就没有考虑这些问题 ^_^ 如果物面全部是直边 那么只要改变一个参数N 就可以获得不同的计算精度 且具 有谱精度 因为单元的节点是Gauss-Legendre-Lobatto积分点。 其实就是谱元法 （物面是曲边的情况我不清楚是不是也可以通过提高基函数的阶数 也就是增加N 来提高计算精度）(Wrote a two-dimensional Euler equations with discontinuous finite element program Last made ​ ​ a triangular element of the program, not curved edge unit is so easy to form a vortex in the cylinder behind the Program to curved edge quadrilateral element vortices appear Unit is the order of 8-node quadrilateral element node number is 15,263,748 which is the four corners of the points in turn Is 1234 and then the side of the midpoint of the number 5678. Time promote the use of Runge-Kutta method Numerical flux of the overall situation of Lax-Friedrichs, flux Still can not capture the shock wave did not do the reconstruction or artificial viscosity do it Zaifayici. The program is not optimized for example, memory consumption is not optimized such as straight-edge boundary integral of the unit is still mining Integral method to increase the amount of computation such as surface integral with a curved edge, the line integral using the Gauss- The Legendr)

计算牛顿和拉格朗日插值方法,用户输入插值结点(calculated Newton and Lagrange interpolation methods, user input interpolation nodes)

无迹卡尔曼滤波算法的c语言。网上找到的，貌似是老外编的，蛮不错的。(unscented kalman filter code of visual c.)

最新版的oofem 可以自己加入一些材料模型 版本更新速度也算快(latest version of oofem )

说明：  一个用C语言编写的求混沌序列的源程序,挺好的!(a C language for the chaotic sequence of the source, very good!)

说明：  数值分析中的chebyshev拟合程序，学习数值分析的同学可以参考参考(Numerical Analysis of chebyshev fit program, students study and numerical analysis can refer to reference)

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