搜索资源列表
demo_nnls
- PLS - DN是一个有限的牛顿为解决非退化的分段线性系统的算法。 PLS - DN的展品可证明半迭代 财产即在全球范围内的精确解在有限数量的迭代算法收敛。被证明是收敛速度 至少前终止线性。 广泛的算法是在我们的AISTATS 2011纸描述：“一个非退化的分段线性系统的有限牛顿算法”。此演示包重新运行 在解决非负最小二乘法（NNLS）问题上的三个稀疏的设计矩阵，从哈威尔波音收集（达夫等人，1989年）第4.2节的实验。 随着PLS - DN，此演示包建
shuzhifenxishangjiliti
- 数值分析中牛顿迭代法、超松弛迭代法、定步长法算例分析-Newton' s iterative method of numerical analysis, over-relaxation iteration method, fixed-step method Analysis of Cases
TDOA_estimation_Newton
- 基于MATLAB仿真程序，使用牛顿迭代法，在已知时延先验信息的基础上，对目标实现无源定位。 程序内还包含符号迭代和等值线绘图等角复杂代码。希望对研究无源定位的同志有所帮助。-MATLAB-based simulation program, using Newton s iterative method, the known delay on the basis of prior information on target to achieve passive positioning.
math_calculate
- 二分法，Newton迭代法和弦截法求方程根，并比较迭代次数。内含各种迭代法及数值加速方法的说明和比较。-Dichotomy, Newton iteration method for the equation of the root chord section, and compare the number of iterations. Includes a variety of accelerated iterative method and numerical descr iption of
newtraph
- newton and raphson method use a root in polynomial or function iterative method-newton and raphson method use a root in polynomial or function iterative method
Matlab
- Gauss Seidel 解数学矩阵方程 Bisection 解1元高次方程 Newton Method 解高次方程 Taylor series 泰勒公式求方程近似解-In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to
numerical-method
- 计算方法课程中矩阵分解，牛顿迭代以及特征值求解的全部代码-Matrix decomposition method of calculating course, Newton s iterative eigenvalue solution and all code
search
- 一个求解微分方程的小程序，用的是牛顿迭代算法，精度高。-A solution of the differential equation small program, with Newton s iterative algorithm, high precision.
differentia
- 一个控制系统仿真程序，实现对水管的高度和温度控制，采用简单控制器。-A solution of the differential equation small program, with Newton s iterative algorithm, high precision.
Nonlinear-equations
- 求非线性方程一个实根的对分法，牛顿法，埃特金迭代法，连分式法，QR法，牛顿下山法。-Nonlinear equations a real root of sub-law, Newton s method, Aitken iterative method, continued fraction method, QR method, Newton downhill method.
yakebi
- 用牛顿-雅可比迭代法求非线性方程组的一个根-Newton- Jacobi iterative method of nonlinear equations of a root .
Ch6
- 迭代法求解非线性方程的解，包括二分法、牛顿法及抛物线法-Iterative method for solving nonlinear equations, including the dichotomy, Newton' s method and the parabolic law
iteration-calculate.rar
- 简单迭代法，艾肯特迭代法，牛顿迭代法计算实例,Examples of simple iterative method, Aiken Te iterative method of Newton iteration
Newtonxs
- 牛顿下山法程序。该程序是用来求方程根的迭代方法。-Newton downhill method procedures. The program is an iterative method to the equation root.
Newtonxq
- 牛顿法的matlab程序。该函数是用牛顿法求根的迭代方法。-Newton method matlab program. The function is an iterative method for finding roots of Newton method.
9-5
- 分别利用牛顿迭代法，只计算一次导数的迭代法和每隔一部计算一次导数的迭代法计算方程的解。使用参考doc文档。-Respectively, using Newton' s iterative method to calculate the first derivative of the iterative method and every one solution to calculate the first derivative of the iterative method calcula
niudunfa
- 牛顿法求非线性函数 间接求法 迭代法-Newton' s method for solving nonlinear function of the indirect method for finding iterative method
TEST1404
- 迭代法，牛顿法，二分法，弦截法迭代法，-Iterative method, Newton method, dichotomy, Secant method
matlab_files
- 四阶龙格库塔方法，拉格朗日迭代，牛顿迭代，这几个有用的迭代方法，简单实用-Fourth-order Runge-Kutta method, Lagrange iteration, Newton iteration, several useful iterative method, simple and practical
xiashan
- MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<> 迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x