经典循环赛日程表算法

平均因子分解法，适用于正定矩阵First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X=U U, where U is the square root matrix of X, and satisfies: (1) U U = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is "positive definite" which guarantees the existence of such kind of decomposition. -Average factor decomposition method applied to positive definite matrix First, let s recall the definition of the Cholesky decomposition: Given a symmetric positive definite square matrix X, the Cholesky decomposition of X is the factorization X = UU, where U is the square root matrix of X, and satisfies: (1) UU = X (2) U is upper triangular (that is, it has all zeros below the diagonal). It seems that the assumption of positive definiteness is necessary. Actually, it is positive

大数类，重载了各类操作符，可以直接使用-fate categories, a variety of heavy-duty operator can be used directly

很简单的程序,只是一个+法运算,给大家玩玩,想下载个资源-GOOD

计算地球或椭圆体中两点距离的程序-A program which can calculate the instance of two points in the earth or the elipse

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

7、满足随机数大于交叉概率的进行交叉，双交叉点交叉法（已实现）8、初始种群中染色体用Floyd方法或扫描法（未实现，想等到收敛性有一定程度的保证后再采用扫描法）9、两点之间的距离是坐标间的直线距离，之后可以用直接输入的距离10、迭代次数不是很稳定，有时候会陷入死循环，停止调试，重新调试即可11、每点击一次重新运行，程序便从头计算一次，目前我自己遇到的最好结果是3辆车、20个点的情况下总路程105.4，最好染色体适应度0.09+12、约束条件是：车辆数量、载重量和里程数。超出载重量或里程数则换车，超出车已有车辆数量就惩罚。13、建立了解决VRP问题的类，需要时派生出不同的参数适应不同问题

拉格朗日插值误差计算-Lagrange interpolation error calculation

应用背景一个小的井字脚趾由我´游戏。例： ；#包括

以面向对象方法实现的数值算法类库，包括 向量、矩阵等的运算以及FFT-object-oriented methods to achieve the numerical algorithm library, including vector, matrix arithmetic and FFT

一个开源的adobeflex开发项目，使用C#和带有语法颜色高亮显示、代码提示和代码完成助手的平台SDK工具