Methods without secant steps for finding a bracketed root

Abstract

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)
DOI: 10.1007/BF02252259

Topics

1 Figure or Table

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