On the structure of zero finders
- 1 June 1977
- journal article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 17 (2) , 170-183
- https://doi.org/10.1007/bf01932288
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a FunctionACM Transactions on Mathematical Software, 1975
- Exception handlingCommunications of the ACM, 1975
- The pfort verifierSoftware: Practice and Experience, 1974
- A new high order method of regula falsi type for computing a root of an equationBIT Numerical Mathematics, 1973
- An algorithm with guaranteed convergence for finding a zero of a functionThe Computer Journal, 1971
- The solution of simultaneous nonlinear equationsPublished by Association for Computing Machinery (ACM) ,1967
- A Method for Solving Algebraic Equations Using an Automatic ComputerMathematical Tables and Other Aids to Computation, 1956