# 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} }

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

#### Topics from this paper

#### 594 Citations

New Optimal Fourth Order Iterative Method for Solving Nonlinear Equations

- 2020

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 this… Expand

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 order… Expand

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

- Mathematics
- 1975

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 methods… Expand

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 special… Expand

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 optimal… Expand

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 of… Expand

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 optimal… Expand

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 their… Expand

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

#### References

SHOWING 1-10 OF 18 REFERENCES

Optimal iterative processes for root-finding

- Mathematics
- 1972

Letf0(x) be a function of one variable with a simple zero atr0. An iteration scheme is said to be locally convergent if, for some initial approximationsx1, ...,xs nearr0 and all functionsf which are… Expand

On functional iteration and the calculation of roots

- Computer Science, Mathematics
- ACM National Meeting
- 1961

This paper has the dual objectives of setting theoretical limits to the rates of convergence of iteration processes towards the zeros of a function when the values of the function and its derivatives are available and suggesting new families of computationally effective iteration formulas. Expand

Iterative solution of nonlinear equations in several variables

- Computer Science, Mathematics
- Computer science and applied mathematics
- 1970

Convergence of Minimization Methods An Annotated List of Basic Reference Books Bibliography Author Index Subject Index. Expand

Computational Complexity of One-Point and Multipoint Iteration,

- Mathematics
- 1973

Abstract : Let phi be an iteration for approximating the solution of a problem f. A new efficiency measure e(phi,f) is defined. For a given problem f, the authors define the optimal efficiency E(f)… Expand

A Family of Fourth Order Methods for Nonlinear Equations

- Mathematics
- 1973

A family of fourth order iterative methods for finding simple zeros of nonlinear functions is displayed. The methods require evaluation of the function and its derivative at the starting point of e...

Some efficient fourth order multipoint methods for solving equations

- Mathematics
- 1969

In this paper we derive a simple and efficient fourth order multipoint iterative method for solving equations. Comparisons of computational efficiency are made with other well known techniques and a… Expand

Efficient Algorithms for Polynomial Interpolation and Numerical Differentiation

- Mathematics
- 1970

Algorithms based on Newton's interpolation formula are given for: simple polynomial interpolation, polynomial interpolation with derivatives supplied at some of the data points, interpolation with… Expand

Computational Complexity of Iterative Processes

- Computer Science
- SIAM J. Comput.
- 1972

The relation between the goodness of an iteration algorithm and its new function evaluation and memory requirements are analyzed and a new conjecture is stated. Expand

Optimal order for i terat ions using two evaluations

- SIAM J . Numer . Anal .
- 1973

Optimal order for iterations using two evaluations

- Report, Computer Sci. Dep. , Carnegie-Mellon U., Pittsburgh,
- 1973