On the structure of zero finders

DOI10.1007/BF01932288MaRDI QIDQ4140290zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A Method for Solving Algebraic Equations Using an Automatic Computer
• A new high order method of regula falsi type for computing a root of an equation
• An algorithm with guaranteed convergence for finding a zero of a function
• Exception handling
• scientific article; zbMATH DE number 3226460 (Why is no real title available?)
• scientific article; zbMATH DE number 3316497 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• The pfort verifier
• Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function

Cited in

(4)

• 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

Describes a project that uses

Uses Software

• BRENT
• zeroin

This page was built for publication: On the structure of zero finders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4140290)