A comparison of non-linear equation solvers

DOI10.1016/0771-050X(76)90017-6MaRDI QIDQ1228177zbMATH OpenFDO

Authors D. Nerinckx, Ann Haegemans

Publication date 1976

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0771-050X(76)90017-6

Mathematics Subject Classification ID

Roundoff error (65G50) Numerical computation of solutions to single equations (65H05) Algorithms in computer science (68W99)

Cites work

• A modified regula falsi method for computing the root of an equation
• 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
• scientific article; zbMATH DE number 3454754 (Why is no real title available?)
• scientific article; zbMATH DE number 3316497 (Why is no real title available?)
• scientific article; zbMATH DE number 3420157 (Why is no real title available?)
• The “Pegasus” method for computing the root of an equation

Cited in

(9)

• On dependence of MR- and MM-algorithms upon the value of switching control variable CTR
• On a class of omnibus algorithms for zero-finding
• A Fortran program for solving a nonlinear equation by Muller's method
• Bibliography on the evaluation of numerical software
• A common framework for modified regula falsi methods and new methods of this kind
• Several new methods for solving equations
• An accurate Fortran code for computing hydrogenic continuum wave functions at a wide range of parameters
• A superlinear scaling factor regula falsi root finder that detects the simple or multiple character of the root
• A parallel algorithm for simple roots of polynomials

Describes a project that uses

Uses Software

• zeroin

This page was built for publication: A comparison of non-linear equation solvers

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