pith. sign in

arxiv: 1110.2281 · v1 · pith:C4I2TBZ6new · submitted 2011-10-11 · 🧮 math.NA · cs.NA

On the approximation of derivatives using divided difference operators preserving the local convergence order of iterative methods

classification 🧮 math.NA cs.NA
keywords orderdifferencedividedconvergenceoperatorcomputationlocalmethod
0
0 comments X
read the original abstract

A development of an inverse first-order divided difference operator for functions of several variables is presented. Two generalized derivative-free algorithms builded 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 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 paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.