×

zbMATH — the first resource for mathematics

A new high order method of regula falsi type for computing a root of an equation. (English) Zbl 0263.65054

MSC:
65H05 Numerical computation of solutions to single equations
Software:
praxis
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Å. Björck and G. Dahlquist,Numerical Methods, Prentice-Hall, Englewood Cliffs, N.J., (to appear).
[2] R. P. Brent,Algorithms for Finding Zeros and Extrema of Functions Without Calculating Derivatives, Report STAN-CS-71-198, Stanford University, 1971.
[3] M. Dowell and P. Jarratt,A Modified Regula Falsi Method for Computing the Root of an Equation, BIT 11 (1971), 168–174. · Zbl 0236.65036 · doi:10.1007/BF01934364
[4] M. Dowell and P. Jarratt,The ”Pegasus” Method for Computing the Root of an Equation, BIT 12 (1972), 503–508. · Zbl 0249.65027 · doi:10.1007/BF01932959
[5] A. S. Householder,The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill, New York, 1970. · Zbl 0242.65047
[6] G. K. Kristiansen,Zero of Arbitrary Function, ALGOL PROGRAMMING, BIT 3 (1963), 204–208. · doi:10.1007/BF01939987
[7] G. Peters and J. H. Wilkinson,Eigenvalues of Ax=\(\lambda\)Bx with Band Symmetric A and B, Computer Journal 12 (1969), 398–404. · Zbl 0185.40204 · doi:10.1093/comjnl/12.4.398
[8] J. F. Traub,Iterative Methods for the Solution of Equations, Prentice-Hall, Englewood Cliffs, N.J., 1964. · Zbl 0121.11204
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.