article

Free access

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

Editor: John R. Rice Authors:

J. C. P. Bus,

T. J. DekkerAuthors Info & Claims

ACM Transactions on Mathematical Software (TOMS), Volume 1, Issue 4

Pages 330 - 345

https://doi.org/10.1145/355656.355659

Published: 01 December 1975 Publication History

PDF eReader

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.

Google Scholar

[2]

BRENT, R.P. An algorithm with guaranteed convergence for finding a zero of a function. Computer J. 1~ (1971), 422-425.

Google Scholar

[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.

Google Scholar

[4]

DOWELL, M., AND JARRATT, P. A modified regula falsi method for computing the root of an equation. BIT 11 (1971), 168-174.

Google Scholar

[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.

Google Scholar

Cited By

View all

Soomro MKalhoro ZShaikh AJamali SOwais Ali (2024)Modiﬁed Bracketing Iterative Method for Solving Nonlinear EquationsVFAST Transactions on Mathematics10.21015/vtm.v12i1.176112:1(105-120)Online publication date: 9-Apr-2024
https://doi.org/10.21015/vtm.v12i1.1761
Hoffrogge PDaubner SSchneider DNestler BZhou BEiken J(2024)Triple junction benchmark for multiphase-field models combining capillary and bulk driving forcesModelling and Simulation in Materials Science and Engineering10.1088/1361-651X/ad8d6f33:1(015001)Online publication date: 18-Nov-2024
https://doi.org/10.1088/1361-651X/ad8d6f
Song YTsai F(2024)Borehole‐Based Interval Kriging for 3D Lithofacies ModelingWater Resources Research10.1029/2023WR03502060:6Online publication date: 6-Jun-2024
https://doi.org/10.1029/2023WR035020
Show More Cited By

Index Terms

Two Efficient Algorithms with Guaranteed Convergence for Finding a Zero of a Function
1. Mathematics of computing
  1. Mathematical analysis
  2. Mathematical software
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis

Recommendations

On the rate of convergence of two minimax algorithms

We show that the sequences of function values constructed by two versions of a minimax algorithm converge linearly to the minimum values. Both versions use the Pshenichnyi-Pironneau-Polak search direction subprocedure; the first uses an exact line ...
Nonmonotone Levenberg---Marquardt Algorithms and Their Convergence Analysis

In this paper, two nonmonotone Levenberg---Marquardt algorithms for unconstrained nonlinear least-square problems with zero or small residual are presented. These algorithms allow the sequence of objective function values to be nonmonotone, which ...
Convergence of Proximal-Like Algorithms

We analyze proximal methods based on entropy-like distances for the minimization of convex functions subject to nonnegativity constraints. We prove global convergence results for the methods with approximate minimization steps and an ergodic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Mathematical Software

ACM Transactions on Mathematical Software Volume 1, Issue 4

Dec. 1975

96 pages

ISSN:0098-3500

EISSN:1557-7295

DOI:10.1145/355656

Editor:
John R. Rice

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1975

Published in TOMS Volume 1, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

76
Total Citations
View Citations
1,215
Total Downloads

Downloads (Last 12 months)180
Downloads (Last 6 weeks)16

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Soomro MKalhoro ZShaikh AJamali SOwais Ali (2024)Modiﬁed Bracketing Iterative Method for Solving Nonlinear EquationsVFAST Transactions on Mathematics10.21015/vtm.v12i1.176112:1(105-120)Online publication date: 9-Apr-2024
https://doi.org/10.21015/vtm.v12i1.1761
Hoffrogge PDaubner SSchneider DNestler BZhou BEiken J(2024)Triple junction benchmark for multiphase-field models combining capillary and bulk driving forcesModelling and Simulation in Materials Science and Engineering10.1088/1361-651X/ad8d6f33:1(015001)Online publication date: 18-Nov-2024
https://doi.org/10.1088/1361-651X/ad8d6f
Song YTsai F(2024)Borehole‐Based Interval Kriging for 3D Lithofacies ModelingWater Resources Research10.1029/2023WR03502060:6Online publication date: 6-Jun-2024
https://doi.org/10.1029/2023WR035020
Fernández-Díaz JMenéndez-Pérez C(2024)A superlinear Scaling Factor Regula Falsi root finder that detects the simple or multiple character of the rootMathematics and Computers in Simulation10.1016/j.matcom.2023.08.003215(1-20)Online publication date: Jan-2024
https://doi.org/10.1016/j.matcom.2023.08.003
Giles MSheridan-Methven O(2023)Approximating Inverse Cumulative Distribution Functions to Produce Approximate Random VariablesACM Transactions on Mathematical Software10.1145/360493549:3(1-29)Online publication date: 19-Sep-2023
https://dl.acm.org/doi/10.1145/3604935
Rutherford NRaaijmakers GPrescod-Weinstein CWatts A(2023)Constraining bosonic asymmetric dark matter with neutron star mass-radius measurementsPhysical Review D10.1103/PhysRevD.107.103051107:10Online publication date: 30-May-2023
https://doi.org/10.1103/PhysRevD.107.103051
Fasi MHigham N(2021)Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU FactorizationSIAM Journal on Matrix Analysis and Applications10.1137/20M135723842:1(417-435)Online publication date: 18-Mar-2021
https://doi.org/10.1137/20M1357238
Kodnyanko V(2021)Improved bracketing parabolic method for numerical solution of nonlinear equationsApplied Mathematics and Computation10.1016/j.amc.2021.125995400(125995)Online publication date: Jul-2021
https://doi.org/10.1016/j.amc.2021.125995
Oliveira ITakahashi R(2020)An Enhancement of the Bisection Method Average Performance Preserving Minmax OptimalityACM Transactions on Mathematical Software10.1145/342359747:1(1-24)Online publication date: 8-Dec-2020
https://dl.acm.org/doi/10.1145/3423597
Samurović SVudragović A(2018)Testing MOND on two nearby elliptical galaxies: the cases of NGC 4473 and NGC 4697Monthly Notices of the Royal Astronomical Society10.1093/mnras/sty2800482:2(2471-2483)Online publication date: 16-Oct-2018
https://doi.org/10.1093/mnras/sty2800
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

On the rate of convergence of two minimax algorithms

Nonmonotone Levenberg---Marquardt Algorithms and Their Convergence Analysis

Convergence of Proximal-Like Algorithms

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations