搜索资源列表
牛顿迭代法(M)
- 原题：编写一个子程序NewTon（float x0，float eps，float x1）。它的功能是用牛顿迭代法求f（x）=x*x*x-2x*x+4x+1在x=0附近的一个实根。若迭代成功，则返回费0值；否则，返回0。-original title : the preparation of a subroutine NewTon (x0 float, float eps, float x1). Its function is to use Newton's iterative meth
LM
- LM算法的简要描述。LM算法是一种定位多变量函数最小值的迭代技术，是解决非线性最小二乘问题的基本技术之一。-The Levenberg-Marquardt(LM)algorithm is an iterative technique that locates the minimum of a multivariate function that is expressed as the sum of squares of non-linear real-valued functions[4
nanewton1
- 牛顿迭代法 若高阶非线性方程组: u ( x , y) = 0 v ( x , y) = 0 可以用迭代公式 -Newton iteration if the higher-order nonlinear equations: u (x, y) = 0v (x, y) = 0 can be used iterative formula
solve
- 用牛顿法解方程组，迭代法解方程组和求矩阵最大特征值-Newton Method with equations, iterative methods for solution of matrix equations and the largest eigenvalue
matlab_newton
- 用于matlab用牛顿迭代法解方程，这个在数值计算中是很重要的-Matlab by Newton' s iterative method for solving equations, this in numerical calculation is very important to
NewtonMethod
- 用牛顿迭代的方法，编写程序，是函数迭代的效率提高，比一般的迭代法要好很多-By Newton iteration method, the preparation procedure is to improve the efficiency function iteration, iterative method than the average much better
ndimensionNetwon
- 解非线性方程组的N元牛顿法，属于迭代法范畴-Solution of nonlinear equations of the N-Newton method, iterative method belonging to the scope of
shuzhi3
- 龙贝格求积公式，求解定积分 牛顿迭代公式，求方程的近似解 牛顿-科特斯求积公式，求定积分-Romberg quadrature formula for solving the definite integral of Newton s iterative formula, and the approximate solution equation Newton- cortez quadrature formula, and the definite integral
NewtonSorMethod
- 通过牛顿-SOR迭代法求解线性方程 不同的迭代因子有不同的迭代效率，从0至2迭代次数先减少后增加，在1.2附近迭代次数最少，而在0和2 附近次数最多。-Through the Newton-SOR iterative method for solving linear equations iterative different factors have different iteration efficiency, from 0-2 to reduce the number of itera
chaoliujisuan
- 潮流计算，运用高斯赛德尔计算方法迭代求初值，然后用牛顿拉夫逊的方法求出结果。-Flow calculation, the use of high-斯赛德尔iterative calculation method for initial value, and then use the Newton Raphson method to derive the results.
423454
- 数值分析的实验报告，雅各比和高斯塞代尔迭代法，牛顿及拉格朗日插值法，Triangle.cpp等-Numerical Analysis of the experimental reports, and high-CEDEÑ O Jacoby dayr iterative method, Newton and Lagrange interpolation, Triangle.cpp, etc.
powerflow
- 程序实现用牛顿－拉夫逊迭代法进行潮流计算。不仅有潮流计算，还有数据处理的程序-Procedure using the Newton- Raphson iterative method for flow calculation. Not only power flow calculation, as well as data-processing procedures
Numericalanalysiscalculationmethodscommonalgorithm
- 数值分析&计算方法常见算法C语言源代码，内容包括高斯消元，牛顿下山，雅克比迭代等常用数值算法！-Numerical analysis & calculation methods common algorithm C language source code, including Gauss, Newton down the mountain, such as Jacobian iterative numerical algorithm used!
math
- 非线性方程求根的各种算法的比较， //求非线性方程的根 //程序中共给出了以下几种方法求非线性方程的根 // (1)二分法 (2)牛顿法 (3)普通迭代法 (4)斯蒂芬森迭代法 (5)弦截法 //程序中用到的函数为： f(x)=x^3-x-1 //其中:(1)普通迭代法用的迭代函数为：x=(x+1)^(1/3) // (2)斯蒂芬森迭代法用的迭代函数为：x=x^3-1-Root of all kinds of non-linear equation algorithm,/
Newtonliang
- 典型梁元的考虑几何非线性效应的牛顿法迭代程序，使用者可以在此基础上添加自己的有限元程序-Consider typical beam element geometry of the Newton method of nonlinear effects of iterative process, the user can add their own based on the finite element program
fortran
- 用迭代法计算数值积分，误差自己控制，用牛顿迭代法实现。-Iterative method with numerical integration, error under their control, using Newton iteration method.
kepler_equation
- Solving Kepler s Equation Using Newton s iterative Method
jgdhghjd
- DHRT:对分法搜索方程的实根 ATKN：埃特金迭代法求方程的一个实根 NEWT：牛顿迭代法求方程的一个实根 QRRT：QR方法求实系数多项式方程的全部根 NETN：拟牛顿法求非线性方程组的一组实数解-DHRT: method to search for the real roots of equation ATKN: Aitken iterative method for a real roots of equation NEWT: Newton iteration equat
Cshuzhisuanfa
- 经典的C语言数值算法，包括拉格朗日，牛顿插值多项式，牛顿迭代公式，牛顿迭代公式，雅克比迭代-Classical C-numerical algorithm, including the Lagrange, Newton' s interpolation polynomial, Newton' s iterative formula, Newton' s iterative formula, iterative Jacobian
Citerativenumerical
- 主要是二分法，分段线性插值 简单迭代 牛顿迭代等常用的数值计算的程序。-Mainly dichotomy, a simple iterative piecewise linear interpolation commonly used, such as Newton s iterative numerical procedure.