搜索资源列表
分支限界算法求解TSP问题
- 本程序用分支界限方法解决ＴＳＰ问题，即旅行商问题．-the procedures used branch line solution to TSP, the traveling salesman problem.
运筹学最小支撑树求解
- 运筹学最小支撑树的求解方法。该程序共有两种计算方法，可以用不同方法求解出最小支撑树。也可以对求解过程进行单步执行，从而清楚看出算法的求解过程。-tacticians minimum spanning tree method of solution. There are two procedures for the calculation method can use a different method to solve the smallest spanning tree. The solut
四种差分方法求微分方程
- 差分法求解微分方程：古典显式法,收敛性最差；古典隐式法；Crank-Nicolson法,收敛性最好-difference method to solve the differential equation : Explicit classical method, the worst convergence; Classical implicit; Crank-Nicolson, the best convergence
数值方法
- 数值算法 迭带求解算法 用vc写的，简单明了-numerical algorithm iterative algorithm used vc write simple and clear
CUMCM_prize
- 整数规划的一个求解方法（得到CUMCM一等奖）主要思想：找最大元之后的逐步互换求解，有点类似遗传算法-an Integer Programming Solution (with Into First Class) main ideas : after finding the greatest element gradually swap solution, it is somewhat similar genetic algorithms
常微分方程求解
- 包括欧拉法求解、改进欧拉法求解、经典四阶龙格库塔法求解，同时还有这三种方法的结果比较
偏微分方程组N=4的龙格－库塔方法求解
- 偏微分方程组N=4的龙格－库塔方法求解，matlab编程，试过可以
SAR POLSAR
- 关于SAR和极化SAR信息处理的好程序。Cloude.m——经典的Cloude极化分解方法中H/alpha参数的求解方法；classes.m——Cloude极化分解方法；myCFAR.m——三种SAR图像目标检测的恒虚警处理方法。全局CFAR，局部CFAR，指数CFAR-SAR and POLSAR information processing codes. Cloude.m-- H/alpha parameter ofclassic Cloude polarization decomposit
rubicscube
- 魔方自动求解，能快速求出三阶魔方的一般求解方法-Automatic Rubik' s Cube solving, third-order magic cube can quickly find a general solution method
信赖域方法 Matlab 程序)
- 信赖域方法中子问题的求解是算法实现的关键. 信赖域子问题 是一个 目标函数为二次函数的约束优化问题.(The trust region method is the key to the realization of the algorithm. The trust region subproblem is one of the key problems The objective function is a constrained optimization problem with two
Optimal problem solver
- 优化问题求解方法包括牛顿法、共轭梯度法和最速下降法(The optimization problems are solved by Newton method, conjugate gradient method and steepest descent method)
计算方法（C语言版）
- c数值计算方法。线性方程组求解。非线性方程组求解。微分方程数值计算。(c program. linear eqations solving. nonlinear eqations solving. differential eqations eqations.)
Newmark_beta
- 计算jeffcott转子动力学，采用Newmark数值求解方法，具有较高精度(Computate rotor dynamics of Jeffcott)
GetParetoSet
- 该方法为Perato前沿解的求解方法，使用Matlab平台计算(This method is the solution of Perato front solution and is calculated by Matlab platform)
求解方程组方法
- 几种主要的求解方程组方法在MTLAB环境的实现(Implementation of several main solving equations in MTLAB environment)
menmory
- 基于遗传免疫算法的TSP问题求解方法,遗传算法，matlab语言编程(TSP,matlab programe,ga)
fluent的udf中求解二阶导数的方法
- fluent的udf中求解二阶导数的方法(The method of solving the two order derivative in the UDF of fluent)
预处理共轭梯度求解器
- 采用预处理的共轭梯度线性方程组求解方法，可以输入预处理矩阵。
基于结构网格二维Euler方程的Jameson求解方法
- 基于结构网格二维Euler方程的Jameson求解方法 自己写的程序，网格是现成的结构网格(Jameson solution method based on two-dimensional Euler equation of structural grid. Write their own procedures, the grid is ready - made structural grid.)
最速下降法求解方程组
- 最速下降法就是梯度下降法,可以用于求解最小二乘问题(线性和非线性都可以)。可以说是求解机器算法的最古老、最经典的模型，另一种常用的方法是最小二乘法。(The steepest descent method is the gradient descent method, which can be used to solve the least squares problem (both linear and non-linear). It can be said that it is the ol