Solving TSP in Python -Genetic

《优化设计》这门课程中的优化方法的作业，代码思路清晰，运行后没问题。包括，powell法，共轭梯度法，牛顿法，阻尼牛顿法，单纯形法，变尺度法等等。梯度法在第二个目标函数优化时并没有达到理想的点，陷入局部最优，阻尼牛顿法在第二个目标 函数处也精度不高。 用共轭梯度法配合牛顿法一维搜索来第二个目标函数时出现了 NaN 的情况， 是因为牛顿法的代码中运行时出现了分母为0的情况， 但是我在分母加了一个很小的数0.000001之后还会出 现，而已开始用变尺度法和牛顿法优化的时候也出现的 NaN 问题就消失了

在3DIC設計中會使用的方法  Floorplanning is an important and dispensable stage in the traditional integrated circuit design process. With the raised module numbers and increased wire length, the computation complexity is raised dramatically. Obviously, the traditional algorithms need to be updated. We developed an orthogonal table, in which each factor represents a module and the level of a specified factor denotes the orientation of that module. With this orthogonal table, the solution space is significantly decreased.  We use sequence pair to represent a floorplan and the fast longest common subsequence is used accordingly to calculate the area of

传说计算机学院有一位前辈叫做二叉哥，他十八般算法样样精通。他当年在程设的时候由于二叉树一举成名。大家为了纪念这一事件，尊称他为二叉哥！二叉树是一个什么样的东西呢？现在我们就来揭开二叉哥的二叉树的神秘面纱吧！ 下图就是一棵有着9个节点的二叉树。顾名思义，二叉树就像一棵倒着生长的树，每个分叉点可以分出去两个枝条。我们把分叉点叫做“节点”，因为每个分叉点最多可以分出去两个枝条，所以就叫做“二叉”树。最顶层只有一个节点，我们把它叫做根节点。下图中，标号为1的节点就是根节点，它有两个孩子：节点2和节点3。节点2只有一个孩子，标号为4，而节点3有两个孩子，标号分别为5和6。下图中的二叉树第3层有3个节点，分别是7、8和9号节点。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报 打分 发表评论 暂无评论

This library defines basic operation on polynomials, and contains also 3 different roots (zeroes)-finding methods that can handle quite large polynomials (>1000 coefs) Implemented in ANSI C++ Templates. Handles all real and complex floating point types. Html doc is included.-This library defines basic operation on polynomials, and contains also 3 different roots (zeroes)-finding methods that can handle quite large polynomials (>1000 coefs) Implemented in ANSI C++ Templates. Handles all real and complex floating point types. Html doc is included.

用C语言来实现的。求解线性方程组的迭代，是一种简单的迭代法，可不如 Gauss-Seidel迭代法收敛速度快。-Use c language to make a Jacobi iterative arithmetic which could solve the linear equation group, but it s may be more slower than the Gauss-Seidel iterative arithmetic.

unlike kalman filter this filter is more suitable to deal with nonlinear data types. the source code is of omnet++ simulators. which contains a c++ file and other two files is used for network description and the general initialization files.

最小二乘法拟合曲线，在TC2.0中编译通过-least squares fitting, in which compile WITH TC 2.0

这是硕士生计算机软件专业组合数学的一个黄金分割算法演示，仅供参考。-This is the master computer software professional combination of a mathematical algorithm 0.618 demonstration purposes only.

以某地区一部分土地利用现状为基本数据，通过设置目标函数和约束条件，使用遗传算法进行土地利用优化，实验表明优化效果优良。

粒子群优化算法的 C 代码