搜索资源列表
jifen124
- 龙格---库塔方法是求解微分方程比较常用的方法,在理解数学上是怎么一回事后,编制这个程是相当容易的,就是个迭代的过程.步长的选取也是很有讲究的,过小的步长反而会导致误差累积过大. 相关的理论请参考相关的数值算法的书籍，我这里只给出关键的函数及主程序段，其余相关的细节就不再一一罗列了.-Runge - Kutta method to solve the differential equation is more commonly used method, in understanding h
efgxf
- 为计算方法课程的作业（二分割线法求解方程的解）-courses for the calculation of operations (2 segmentation method for the solution of the equation)
fenzhifa.rar
- 分治法的基本思想，掌握递归程序编写方法；使用分治法编程，求解线形序列中第k小元素。,Separation of the basic ideas, grasp the recursive programming methods the use of sub-rule law programming, solving linear sequence of the first k small element.
bxjdd
- 解决了并行机调度问题，本题采用穷举法与随机法相结合的方法求解，可取得最优解。-Solve the parallel machine scheduling problem, the problem using exhaustive method, the optimal solution can be achieved.
c
- 罚函数方法是求解约束（极小）优化问题的一类较好的算法。其基本思想：根据约束的特点构造某种惩罚函数，并把惩罚函数添加到目标函数上去，从而得到一个增广目标函数，使约束优化问题的求解转化为一系列无约束极小优化问题的求解。-Penalty function method for solving constrained (minimum) optimization problem of a class of better algorithms. The basic idea: In accordance
binarysearch
- 二分法求解方程的c语言实现，sin（x）在（-3，7）范围内的c语言实现方法-Solving the equation c dichotomy language, sin (x) in (-3,7) c language within the scope of implementation
treesearch
- 牛顿迭代发求解方程x*x*x-x*x-1的c语言实现方法。-Newton made to solve equation x* x* xx* x-1 c-language implementation.
20080814025250327
- 一般的GPS数据处理软件都是采用上述步骤进行计算的，其中只有第2步涉及转换参数。鉴于我国曾使用不同的坐标基准（BJ54、State80、 Correct54），各地的重力值又有很大差异，所以很难确定一套适合全国且精度较好的转换参数。通行的做法是：在工作区内找三个以上的已知点，利用已 知坐标和所测Wgs84坐标，求解七参数。若多选几个已知点，通过平差的方法可以获得较好的精度。 -General GPS data processing software are used in calculati
CSharpAlgorithm
- CSharp编的算法集合，有各种插值，积分方法、复数计算、线性方程求解等。并定义了几种插值数据输入格式-CSharp compiled a collection of algorithms, there are a variety of interpolation, integration method, complex calculation, the linear equation and so on. And defines several interpolation data input
exe
- 幂法是求解按模最大特征值和相应的特征向量的一种迭代方法。-Power law model is solved by the largest eigenvalue and corresponding eigenvector of an iterative method.
SGA_5
- 用遗传算法来解决多极值函数的求解问题, 程序采用了锦标赛选择方法-Using genetic algorithm to solve the multiple maximum function problem.
grad
- 介绍了一般方程的梯度求解方法 并给出了详细的代码-Describes the general method of solving the gradient equation and gives a detailed code
gss_spd_2.2
- 线性方程组求解,提出了一种快速求解线性方程组的方法-the solving of linear equetions
gss_spd_2.1
- 线性方程组求解，提出了一种快速求解方程组的方法-the solving of linear equation
GaussXiaoqufa
- 高斯消去法，求解线性方程组的解。本方法有利计算机求解。-Gaussian elimination method for solving linear equations solution.
Simplexc
- 单纯形法，求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。-Simplex method, the general method for solving linear programming problems. Simplex American mathematician GB Danzig in 1947 first proposed.
7EULER
- 常微分方程组的求解方法，采用定步长欧拉方法求解-Method for solving ordinary differential equations, using a fixed-step Euler method to solve
7EULER1
- 常微分方程组的求解，采用变步长欧拉方法求解-The solution of ordinary differential equations with variable step size Euler method
7GILL
- 常微分方程组的求解，采用变步长Gill方法求解。-The solution of ordinary differential equations with variable step size Gill method for solving.
MERSON
- 常微分方程组的求解，采用变步长Merson方法求解。-The solution of ordinary differential equations with variable step size Merson method for solving.