搜索资源列表
WinRAR-ZIP
- 数值计算中的基本算法程序，如牛顿法，加速算法，还有一些基本的迭代算法。-Numerical calculation of the basic algorithm, such as Newton' s method, algorithm, there are some basic iterative algorithm acceleration.
iterationOFnewton
- 利用牛顿法实现迭代运算。计算方法为数值计算书上提到的流程-Achieved using Newton iteration method. Process for the numerical calculation method mentioned in the book
Desktop
- 牛顿法进行二次曲面分析，计算各迭代点的局部值-Newton s method analysis of quadric surface, the local value of iterative point is calculated
Multidimensional-Newton
- vb环境下实现牛顿法迭代求最优，最优化原理与方法中无约束最优化的求解-Newton s method to achieve vb environment iterative optimal, optimization theory and methods for solving unconstrained optimization
Newtons-method
- 牛顿法和弦截法求方程根的C++程序，很好的实现迭代求根。-Newton s method chords cut method equation root of c++ program, very good implementation iteration for root.
matlab
- 牛顿最优解拟牛顿法和最速下降法(Steepest Descent Methods)一样只要求每一步迭代时知道目标函数的梯度。通过测量梯度的变化，构造一个目标函数的模型使之足以产生超线性收敛性。这类方法大大优于最速下降法，尤其对于困难的问题。另外，因为拟牛顿法不需要二阶导数的信息，所以有时比牛顿法(Newton s Method)更为有效。-Newton optimal solution
Newton潮流程序
- Newton潮流程序 牛顿法的特点是收敛性比较好，一般潮流计算通常迭代6~7次就能收敛到非常精确的解，而且迭代次数与电力系统规模关系不大。
newton
- 牛顿法球方程，计算每一步迭代结果以及最终迭代次数-Newton' s Law balls equation to calculate the results of each iteration and the final iterations
ninewton
- 拟牛顿法求解方程，计算每一步的结果以及最终迭代次数-Quasi-Newton method for solving equations, each step of the calculation results and the final iterations
Newton-Raphson-Method
- 一个牛顿－拉弗逊法求解非线性问题迭代过程的简单程序例子-A Newton- Laffer Morrison nonlinear problem solving simple program examples iterative process
nonlinear-algorithm
- 非线性算法合集，包括牛顿拉夫逊法，Broyden拟牛顿法，弧长法，割线法。每种算法都包含有线性搜索迭代改进。-Nonlinear algorithm collection, including Newton Raphson, Broyden quasi-Newton method, arc-length method, secant method. Each contains a linear search algorithms for iterative improvement.
gongchengyouhua2
- 工程优化里采用阻尼牛顿法迭代求函数的最小值-Engineering optimization in the use of minimum damping Newton method Iterative Function
cpp
- 最速下降/牛顿法 armijo线性搜索 比较 F(x)=x2+2x2-ln(x1x2-1) 迭代次数、步长 精度ε=0.1 σ1=0.4 ρ=0.5-Steepest descent/Newton method armijo linear search compare F (x) = x2+ 2x2-ln (x1x2-1) iterations, step length Precision ε = 0.1 σ1 = 0.4 ρ = 0.5
CPP2
- 牛顿-拉夫逊法潮流计算,很经典实用的算法，迭代速度快-Newton Ralph Xun power flow calculation
youhua-sheji
- 此问题为无约束非线性优化问题，用牛顿法进行迭代求解,具体的求解过程有MATLAB编程解决。-This problem is unconstrained nonlinear optimization problems were solved by Newton s iterative method for solving a specific procedure has MATLAB programming solutions.
main
- 用牛顿法迭代求解泊松方程，以计算PN结的内建电势分布并绘制能带图，进一步模拟空间电荷区宽度-Use Newton method to solve the Poisson equation in order to calculate the PN junction potential distribution and draw energy band diagram . And simulate the space charge region width
newton
- 通过使用牛顿法，求解某个函数的极小值 选定起始点后，通过newton方法，多次迭代，得到局部最优解-get the minimun value of a function using newton method
NRflow
- 5节点牛顿莱弗逊法潮流计算，高斯消去法迭代-5 Node Shriver Newton Raphson power flow calculation, Gaussian elimination
steepest-descent--and-Newton
- function[x,val,k] dampnm(fun,gfun,hesse,x0) 功能：用阻尼牛顿法求解无约束问题：min f(x) 输入：x0是初始点，fun,gfun,hesse分别是目标函数值，梯度，hesse矩阵的函数 输出：x,val分别是近似最优点和最优值，k是迭代次数-The function/x, val, k dampnm (fun, gfun, Hesse, x0) function: with damped Newton method f
s2
- 给定初值及容许误差，编制牛顿法解方程f(x) 0的通用程序。 （2）给定方程,易知其有三个根 a)由牛顿方法的局部收敛性可知存在当时，Newton迭代序列收敛于根x2*。试确定尽可能大的。 b)试取若干初始值，观察当时Newton序列的收敛性以及收敛于哪一个根。 （3）通过本上机题，你明白了什么？-Given the initial value and allowable error, the preparation of Newton method to solve the e