A modified Newton method with cubic convergence: the multivariate case
By Herbert H. H. Homeier. 2004
199 citations recorded by the source corpus.
Recently, a modification of the Newton method for finding a zero of a univariate function with local cubic convergence has been introduced. Here, we extend this modification to the multi-dimensional case, i.e., we introduce a modified Newton method for vector functions that converges locally cubically, without the need to compute higher derivatives. The case of multiple roots is not treated. Per iteration the method requires one evaluation of the function vector and solving two linear systems with the Jacobian as coefficient matrix, where the Jacobian has to be evaluated twice. Since the additional computational effort is nearly that of an additional Newton step, the proposed method is useful especially in difficult cases where the number of iterations can be reduced by a factor of two in comparison to the Newton method. This much better convergence is indeed possible as shown by a numerical example. Also, the modified Newton method can be advantageous in cases where the evaluation of the function is more expensive than solving a linear system with the Jacobian as coefficient matrix. An example for this is given where numerical quadrature is involved. Finally, we discuss shortly possible extensions of the method to make it globally convergent.
Subfields: Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/fb6912bbf16b593eb3e8df78b8a4e0de4acc07ab
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Numerical Analysis
Citations in the corpus
- On Newton-type methods with cubic convergence (2005, methodology): “(6), the method of Frontini and Sormani [5], and Homeier [6,7] (FSH), Eq.”
- Efficient Jarratt-like methods for solving systems of nonlinear equations (2014, methodology): “[13], Homeier [17] and Noor-Waseem [21] have developed third order methods each requiring three evaluations namely, one F and two F′ per iteration.”