Zero-finder methods derived from Obreshkov's techniques (Q1049310): Difference between revisions

The paper presents a method of determining the zeros of a nonlinear equation \(f(x)=0\). The method is based on the Obreshkov quadrature [cf. \textit{N. Obreskov}, Abh. Preuss. Akad. Wiss., Math.-Naturw. Kl. 1940, No.~4, 1--20 (1940; Zbl 0024.02602)]. Obreshkov's method is used to 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 are obtained. An analysis of these methods is presented. The concept of extrapolated computational order of convergence is also introduced to test the convergence of the iterative scheme. The scheme is tested with the seven functions and the results are compared with the Chebyshev method or the modified Chebyshev method.