-
四阶龙格-库塔法
说明: 利用四阶龙格库塔求解微分方程,并给出方程实例。(The fourth order Runge Kutta is used to solve the differential equation and an example is given.)
- 2020-07-04 18:33:12下载
- 积分:1
-
work
以上是两个内点法程序,原仿射内点法,对偶仿射内点法。初始内点需要自己给出,自动求解初始内点的程序下次发送(These are the two interior point method procedure, the original affine interior point method, dual affine interior point method. Initial interior point needs its own given the initial interior point solution of automatic procedures to send the next)
- 2008-05-05 23:05:34下载
- 积分:1
-
1.21b
分数阶滑模工具箱,可用于解决阶次比较低的时候(fractional order sliding mode )
- 2016-10-10 09:37:28下载
- 积分:1
-
1
说明: 利用有限差分法求解雷诺方程,进而可以求解气体静压轴承的特性(The Reynolds equation is solved by the finite difference method, and the characteristics of aerostatic bearing can be solved.)
- 2018-05-19 18:05:08下载
- 积分:1
-
2011B题
用来作为数学建的参考资料学习,希望对爱好则用所帮助(math model study study .Used as a reference material for Mathematical Studies)
- 2017-06-25 20:39:30下载
- 积分:1
-
dijkstra
最好的dijkstra 算法 matlab实现。
可以计算任意两点间的最短距离和路径。
不要参考其他的matlab程序,他们的路径都有问题。(Best Dijkstra algorithm matlab. You can calculate the shortest distance between any two points and path. Do not refer to other matlab program, their path has a problem.)
- 2013-05-21 12:51:37下载
- 积分:1
-
floyd
求解最短路算法,,,
赋路径初值 更新 显示迭代步数
显示每步迭代后(solve the lest distance)
- 2013-09-13 12:35:54下载
- 积分:1
-
单纯形法Matlab程序-2016-11-17
一般线性规划问题具有线性方程组的变量数大于方程个数,这时会有不定的解。当决策变量个数n和约束条件个数m较大时,单纯形法是求解线性规划问题的通用方法。
从线性方程组找出一个个的单纯形,每一个单纯形可以求得一组解,然后再判断该解使目标函数值是增大还是变小了,决定下一步选择的单纯形。通过优化迭代,直到目标函数实现最大或最小值(In general linear programming problems, the number of variables with linear equations is greater than the number of equations. When the number of decision variables n and constraint number m are large, simplex method is the general method for solving linear programming problems.
Find out one by one from the linear equations of the simplex, each a simplex can get a set of solution, and then concludes that the solution is the objective function value increases or smaller and decided to choose the next simplex. By optimizing iteration, until the target function achieves the maximum or minimum value.)
- 2018-03-27 17:22:03下载
- 积分:1
-
bycgste
共轭梯度法(Conjugate Gradient)是介于最速下降法与牛顿法之间的一个方法,它仅需利用一阶导数信息,但克服了最速下降法收敛慢的缺点,又避免了牛顿法需要存储和计算Hesse矩阵并求逆的缺点,共轭梯度法不仅是解决大型线性方程组最有用的方法之一,也是解大型非线性最优化最有效的算法之一(Conjugate gradient method (Conjugate Gradient) is between the steepest descent method and Newton' s method between a method that takes only a first derivative information, but to overcome the slow convergence of the steepest descent method shortcomings, but also avoid the need to store Newton and computing the inverse Hesse matrix and disadvantages, conjugate gradient method is not only to solve large linear equations of the most useful methods, large-scale nonlinear optimization solution is the most efficient algorithms)
- 2013-09-13 16:33:21下载
- 积分:1
-
CSAMT_1D_forword
一维CSAMT正演程序,对学地球物理的有帮助(CSAMT)
- 2021-04-16 17:58:54下载
- 积分:1