Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function

Full text

Pdf (829 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 1 , Issue 4 (December 1975) table of contents

Pages: 330 - 345

Year of Publication: 1975

ISSN:0098-3500

Authors

J. C. P. Bus	J.C.P. Bus, Mathematical Centre, Tweede Boerhaavestraat 49, Amsterdam, The Netherlands
T. J. Dekker	University of Amsterdam, Roetersstraat 15, Amsterdam, The Netherlands

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 56, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355656.355659 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ANDERSON, N., AND BJ0~tCK, A. A new high order method of regula falsi type for computing a root of an equation. BIT 13 (1973), 253-264.
	2	BRENT, R.P. An algorithm with guaranteed convergence for finding a zero of a function. Computer J. 1~ (1971), 422-425.
	3	DEKKER, T.J. Finding a zero by means of successive linear interpolation. In Constructive Aspects of the Fundamental Theorem of Algebra, B. Dejon and P. Henrici, Eds., Wiley Interscience, London, 1969.
	4	DOWELL, M., AND JARRATT, P. A modified regula falsi method for computing the root of an equation. BIT 11 (1971), 168-174.
	5	JARRATT, P., AND NUDDS, D. The use of rational functions in the iterative solution of equations on a digital computer. Computer J. 8 (1965), 62-65.

CITED BY 7

	Ian Gladwell, Initial Value Routines in the NAG Library, ACM Transactions on Mathematical Software (TOMS), v.5 n.4, p.386-400, Dec. 1979
	Barry W. Brown , Lawrence B. Levy, Certification of Algorithm 708: significant-digit computation of the incomplete beta, ACM Transactions on Mathematical Software (TOMS), v.20 n.3, p.393-397, Sept. 1994
	M.A. Salgueiro da Silva, A novel method for robust minimisation of univariate functions with quadratic convergence, Journal of Computational and Applied Mathematics, v.200 n.1, p.168-177, March, 2007
	Victor Norton, ALGORITHM 631: finding a bracketed zero by Larkin's method of rational interpolation, ACM Transactions on Mathematical Software (TOMS), v.11 n.2, p.120-134, June 1985
	D. Le, An efficient derivative-free method for solving nonlinear equations, ACM Transactions on Mathematical Software (TOMS), v.11 n.3, p.250-262, Sept. 1985
	G. E. Alefeld , F. A. Potra , Yixun Shi, Algorithm 748: enclosing zeros of continuous functions, ACM Transactions on Mathematical Software (TOMS), v.21 n.3, p.327-344, Sept. 1995
	N. Prabhu , W. He, A quartic nonlinear optimization method, Neural, Parallel & Scientific Computations, v.10 n.2, p.209-226, June 2002