×

Some variant of Newton’s method with third-order convergence. (English) Zbl 1037.65051

Newton’s method for the approximation of the root \(x\) of a system of nonlinear equations can be interpreted as a computation of the indefinite integral arising from Newton’s theorem. Using various quadrature formulas one can obtain various iterative processes, the so-called modifications of Newton method.
An error analysis providing the higher order of convergence is proposed and the best efficiency, in the term of function evaluations, of two of these methods is provided. It is proved that if the order of the quadrature formula is at last one and if \(x\) is a simple root, then the order of the method is always three, independently of the order quadrature formula. Among this class of methods the most efficient ones are the iterative methods using the mid/point and trapezoidal quadrature rules.

MSC:

65H10 Numerical computation of solutions to systems of equations
65D32 Numerical quadrature and cubature formulas
30E20 Integration, integrals of Cauchy type, integral representations of analytic functions in the complex plane
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Dennis, J. E.; Schnable, R. B., Numerical Methods for Unconstrained Optimization and Nonlinear Equation (1983), Prentice-Hall: Prentice-Hall New York
[2] Gautschi, W., Numerical Analysis: an Introduction (1997), Birkhäuser · Zbl 0877.65001
[3] Weerakoom, S.; Fernando, T. G.I., A variant of Newton’s method with accelerated third-order convergence, Appl. Math. Lett., 13, 87-93 (2000) · Zbl 0973.65037
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.