Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
Open Access
- 1 December 1975
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 1 (4) , 330-345
- https://doi.org/10.1145/355656.355659
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- A new high order method of regula falsi type for computing a root of an equationBIT Numerical Mathematics, 1973
- A modified regula falsi method for computing the root of an equationBIT Numerical Mathematics, 1971
- An algorithm with guaranteed convergence for finding a zero of a functionThe Computer Journal, 1971
- The Use of Rational Functions in the Iterative Solution of Equations on a Digital ComputerThe Computer Journal, 1965