On the structure of zero finders

DOI10.1007/BF01932288zbMath0365.65029OpenAlexW1981634577MaRDI QIDQ4140290

Gaston H. Gonnet

Publication date: 1977

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932288

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items

On a class of omnibus algorithms for zero-finding, Iteratively reweighted least squares: A comparison of several single step algorithms for linear models, Bibliography on the evaluation of numerical software, Computational error estimates and adaptive processes for some nonlinear structural problems

Uses Software

• BRENT
• zeroin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Method for Solving Algebraic Equations Using an Automatic Computer
• The pfort verifier
• Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
• Exception handling
• An algorithm with guaranteed convergence for finding a zero of a function
• A new high order method of regula falsi type for computing a root of an equation