# Optimal Order of One-Point and Multipoint Iteration

```@article{Kung1974OptimalOO,
title={Optimal Order of One-Point and Multipoint Iteration},
author={H. T. Kung and Joseph F. Traub},
journal={J. ACM},
year={1974},
volume={21},
pages={643-651}
}```
• Published 1974
• Mathematics, Computer Science
• J. ACM
The problem is to calculate a simple zero of a nonlinear function ƒ by iteration. There is exhibited a family of iterations of order 2<supscrpt><italic>n</italic>-1</supscrpt> which use <italic>n</italic> evaluations of ƒ and no derivative evaluations, as well as a second family of iterations of order 2<supscrpt><italic>n</italic>-1</supscrpt> based on <italic>n</italic> — 1 evaluations of ƒ and one of ƒ′. In particular, with four evaluations an iteration of eighth order is constructed. The… Expand
594 Citations

#### Topics from this paper

New Optimal Fourth Order Iterative Method for Solving Nonlinear Equations
We have presented a new optimal fourth order iterative method in this paper. Every iteration desires one function evaluation and two first derivative evaluations and therefore the efficiency of thisExpand
One Parameter Optimal Derivative-Free Family to Find the Multiple Roots of Algebraic Nonlinear Equations
• Mathematics
• 2020
In this study, we construct the one parameter optimal derivative-free iterative family to find the multiple roots of an algebraic nonlinear function. Many researchers developed the higher orderExpand
Construction of fourth-order optimal families of iterative methods and their dynamics
• Computer Science, Mathematics
• Appl. Math. Comput.
• 2015
A general class of fourth-order optimal multi-point methods without memory for obtaining simple roots without memory is proposed, found that they are very useful in high precision computations. Expand
SOME HIGH-ORDER ZERO-FINDING METHODS USING ALMOST ORTHOGONAL POLYNOMIALS
Some multipoint iterative methods without memory, for approximating simple zeros of functions of one variable, are described. For m > 0, n g 0, and k satisfying m + 1 g k > 0, there exist methodsExpand
On a general class of optimal order multipoint methods for solving nonlinear equations
• Mathematics
• 2017
Abstract We develop a class of n-point iterative methods with optimal 2 n order of convergence for solving nonlinear equations. Newton's second order and Ostrowski's fourth order methods are specialExpand
Optimal eighth-order iterative methods for approximating multiple zeros of nonlinear functions
• Mathematics
• 2020
It is well known that the optimal iterative methods are of more significance than the non-optimal ones in view of their efficiency and convergence speed. There are only a few number of optimalExpand
An optimal scheme for multiple roots of nonlinear equations with eighth-order convergence
• Mathematics
• Journal of Mathematical Chemistry
• 2018
We have a good number of eighth-order iterative methods for simple zeros of nonlinear equations in the available literature. But, unfortunately, we don’t have a single iterative method ofExpand
Optimal order and efficiency for iterations with two evaluations
• Mathematics
• 1976
The problem is to calculate a simple zero of a nonlinear function f. We consider rational iterations without memory which use two evaluations of f or its derivatives. It is shown that the optimalExpand
Multiplicity anomalies of an optimal fourth-order class of iterative methods for solving nonlinear equations
• Mathematics
• 2017
There is a few number of optimal fourth-order iterative methods for obtaining the multiple roots of nonlinear equations. But, in most of the earlier studies, scholars gave the flexibility in theirExpand
An eighth-order family of optimal multiple root finders and its dynamics
• Computer Science, Mathematics
• Numerical Algorithms
• 2017
This work presents an optimal eighth-order iteration function for multiple zeros and demonstrates the applicability of the proposed scheme on real-life problems and illustrates that the proposed methods are more efficient among the available multiple root finding techniques. Expand