长整数的四则运算

全元主高斯－约当法消去法求线形代数方程的解-Quan-yuan main Gauss- Jordan method elimination method for linear algebraic equations

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.

里面包含了一个用VC开发的二分法程序，牛顿迭代法程序源码-Which contains a dichotomy with VC development procedures, Newton iteration procedure source

该程序用matlab语言编写的计算机潮流计算程序。-the procedures used Matlab language trend of the computer program.

用模拟退火算法实现的车辆配送货问题，当时的智能算法作业，自己纯手编。希望对大家有用。

四人过河求时间最短问题-four for the shortest river issues

用K均值算法实现聚类分析的Vc源码，界面和算法都有-K-means cluster analysis algorithm source of Vc

机械优化设计的C程序，黄金分割法，解决一维优化问题-Optimal Design of C mechanical procedures, golden section method to solve one-dimensional optimization problem

DFP变尺度法，包括一维搜索法，黄金分割法，采用类封装，包括矩阵类，变尺度类。实现简单明了。-DFP variable metric method, including the one-dimensional search, golden section method, type of packaging used, including matrix-type, variable-scale category. Simple to achieve.

线性CCD测试代码+调试教程控制程序,实现线性CCD的采集循迹和处理,可用于飞思卡尔智能车,车模的调试和测试