A number of methods that require only function evaluation to find a bracketed root are discussed. The Snyder, Pegasus, and Anderson-Björck schemes of Regula Falsi type converge superlinearly, but all use relatively slow secant steps. Two recent methods are faster because they exploit the rational interpolation step used by Anderson and Björck, and virtually… (More)

Finding a zero by means of successive linear interpolation

T. J. Dekker

1969

1 Excerpt

The use of rational functions in the iterative solution of equations on a digital computer

P. Jarratt, D. Nudds

Comp. J

1965

2 Excerpts

A method for solving algebraic equations using an automatic

D. E. Muller

computer. Math. Comp

1956

1 Excerpt

Inverse interpolation, a real root of f(x)=O

J. N. Snyder

University of Illinois Digital Computer…

1953

1 Excerpt

Similar Papers

Loading similar papers…

Cite this paper

@article{King1976MethodsWS,
title={Methods without secant steps for finding a bracketed root},
author={R. F. King},
journal={Computing},
year={1976},
volume={17},
pages={49-57}
}