Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



On enclosing simple roots of nonlinear equations

Authors: G. Alefeld, F. A. Potra and Yixun Shi
Journal: Math. Comp. 61 (1993), 733-744
MSC: Primary 65H05
MathSciNet review: 1192965
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper we present two efficient algorithms for enclosing a simple root of the nonlinear equation $ f(x) = 0$ in the interval [a, b]. They improve recent methods of Alefeld and Potra by achieving higher efficiency indices and avoiding the solution of a quadratic equation per iteration. The efficiency indices of our methods are 1.5537... and 1.618... , respectively. We show that our second method is an optimal algorithm in some sense. Our numerical experiments show that the two methods of the present paper compare well with the above methods of Alefeld and Potra as well as efficient solvers of Dekker, Brent, and Le. The second method in this paper has the best behavior of all, especially when the termination tolerance is small.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65H05

Retrieve articles in all journals with MSC: 65H05

Additional Information

Article copyright: © Copyright 1993 American Mathematical Society

American Mathematical Society