Zero-finder methods derived from Obreshkov’s techniques

摘要

In this paper two families of zero-finding iterative methods for solving nonlinear equations f(x)=0 are presented. The key idea to derive them is to solve an initial value problem applying Obreshkov-like techniques. More explicitly, Obreshkov’s methods have been used to numerically solve an initial value problem that involves the inverse of the function f that defines the equation. Carrying out this procedure, several methods with different orders of local convergence have been obtained. An analysis of the efficiency of these methods is given. Finally we introduce the concept of extrapolated computational order of convergence with the aim of numerically test the given methods. A procedure for the implementation of an iterative method with an adaptive multi-precision arithmetic is also presented.