Read/Search this Article
Abstract
In this paper, we deal with a class of multipoint iterative formulas that find new approximations to a zero of a function f(x). First of all, we show that the attainable order of convergence is equal to 7 for a class of formulas that require two evaluations off(x) and two of f'(x) per iteration. Furthermore, we show that the attainable order of convergence is equal to 4 for a class of formulas that require one evaluation of f(x) and two of f'(x) per iteration and that the attainable order of convergence is equal to 4 for a class of formulas that require two evaluations of f(x) and one of f'(x) per iteration.
Journal
- Journal of information processing [List of Volumes]
-
Journal of information processing 13(4), 514-521, 1991-02-10 [Table of Contents]
Information Processing Society of Japan (IPSJ)