New stopping criteria for iterative root finding
Open Access
- 1 October 2014
- journal article
- research article
- Published by The Royal Society in Royal Society Open Science
- Vol. 1 (2) , 140206
Abstract
A set of simple stopping criteria is presented, which improve the efficiency of iterative root finding by terminating the iterations immediately when no further improvement of the roots is possible. The criteria use only the function evaluations already needed by the root finding procedure to which they are applied. The improved efficiency is achieved by formulating the stopping criteria in terms of fractional significant digits. Test results show that the new stopping criteria reduce the iteration work load by about one-third compared with the most efficient stopping criteria currently available. This is achieved without compromising the accuracy of the extracted roots.Keywords
This publication has 13 references indexed in Scilit:
- Fractional Significant DigitsSIAM Journal on Scientific Computing, 2013
- A new version of the CADNA library for estimating round-off error propagation in Fortran programsComputer Physics Communications, 2010
- Pathological Functions for Newton's MethodThe American Mathematical Monthly, 1993
- The Laguerre method for finding the zeros of polynomialsIEEE Transactions on Circuits and Systems, 1989
- Practical stopping rule for finding roots of nonlinear equationsJournal of Computational and Applied Mathematics, 1985
- A termination criterion for iterative methods used to find the zeros of polynomialsMathematics of Computation, 1984
- Principles for Testing Polynomial Zerofinding ProgramsACM Transactions on Mathematical Software, 1975
- Two algorithms for the solution of polynomial equations to limiting machine precisionThe Computer Journal, 1975
- A stopping criterion for polynomial root findingCommunications of the ACM, 1967
- ALGOL programmingBIT Numerical Mathematics, 1961