An improvement of convergence in Newton's method
β Scribed by S. Lopez
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 393 KB
- Volume
- 145
- Category
- Article
- ISSN
- 0045-7825
No coin nor oath required. For personal study only.
β¦ Synopsis
Newton's method is based on a linear approximation of the function in a neighborhood of a solution point. It can be demonstrated that the error in the current iteration depends on the norm of second derivative. Instead using a higher-order approximation, the second derivative is used here to transform the function into a new one for which Newton's method is faster. Compared with Newton's method, the resulting method only needs to compute some corrective values for the coefficients of first derivative matrix.
In computational mechanics problems, where the discretization schemes lead to very sparse matrices, a considerable improvement in the rapidity of convergence with a negligible increase in the arithmetical operations and without further memory demand, can be obtained.
π SIMILAR VOLUMES
The classical Kantorovich theorem on Newton's method assumes that the first 5 w Ε½ . derivative of the operator involved satisfies a Lipschitz condition β« FΠ x y 0 Ε½ .x5 5 5 FΠ y F L x y y . In this paper, we weaken this condition, assuming that 5 w Ε½ . Ε½ .x5 Ε½5 5 . β« FΠ x y FΠ x F x y x for a given
A local convergence analysis of Newton's method for solving nonlinear equations, under a majorant condition, is presented in this paper. Without assuming convexity of the derivative of the majorant function, which relaxes the Lipschitz condition on the operator under consideration, convergence, the
generalized radius and center Lipschitz conditions with L average are introduced to investigate the convergence of Gauss-Newton's method for finding the nonlinear least squares solution of nonlinear equations. The radii of the convergence ball of Gauss-Newton's method and the uniqueness ball of the