×

On the approximation of derivatives using divided difference operators preserving the local convergence order of iterative methods. (English) Zbl 1308.65074

Summary: A development of an inverse first-order divided difference operator for functions of several variables is presented. Two generalized derivative-free algorithms built up from Ostrowski’s method for solving systems of nonlinear equations are written and analyzed. A direct computation of the local order of convergence for these variants of Ostrowski’s method is given. In order to preserve the local order of convergence, any divided difference operator is not valid. Two counterexamples of computation of a classical divided difference operator without preserving the order are presented. A rigorous study to know a priori if the new method will preserve the order of the original modified method is presented. The conclusion is that this fact does not depend on the method but on the systems of equations and if the associated divided difference verifies a particular condition. A new divided difference operator solving this problem is proposed. Furthermore, a computation that approximates the order of convergence is generated for the examples and it confirms in a numerical way that the order of the methods is well deduced. This study can be applied directly to other Newton’s type methods where derivatives are approximated by divided differences.

MSC:

65H10 Numerical computation of solutions to systems of equations
65Y20 Complexity and performance of numerical algorithms
PDF BibTeX XML Cite
Full Text: DOI arXiv