Variants of Newton’s method for functions of several variables. (English) Zbl 1123.65042

Newton-like methods are discussed for finding a real solution of a system of nonlinear equations: \(F(x)=0\) in \(\mathbb R^n\). The authors propose a midpoint Newton method: \[ x^{(k+1)} = x^{(k)} - J_F((x^{(k)} + z^{(k)})/2)^{-1}F(x^{(k)}, \quad k=0, 1, \dots. \]
Here \(J_F(x)\) is the Jacobian matrix of the function \(F\). \(z^{(k)}\) is defined via a Newton step as
\[ z^{(k)} = x^{(k)}-J_F(x^{(k)})^{-1}F(x^{(k)}). \]
The midpoint Newton method is proven to be of quadratic covergence and illustrated to be better than the Newton method itself with numerical examples. But it is not compared with the two step Newton method and the cost of evaluation of the function \(F\) and its Jacobian at each iteration step is not considered.
Reviewer: Zhen Mei (Toronto)


65H10 Numerical computation of solutions to systems of equations
Full Text: DOI


[1] Ortega, J.M., Numerical analysis. A second course, (1990), SIAM · Zbl 0701.65002
[2] Ortega, J.M.; Rheinboldt, W.C., Iterative solution of nonlinear equations in several variables, (1970), Academic Press, Inc. · Zbl 0241.65046
[3] Weerakoon, S.; Fernando, T.G.I., A variant of newton’s method with accelerated third-order convergence, Applied mathematics letters, 13, 8, 87-93, (2000) · Zbl 0973.65037
[4] Ford, W.F.; Pennline, J.A., Accelerated convergence in newton’s method, SIAM review, 38, 4, 658-659, (1996) · Zbl 0863.65026
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.