Improvements of the Modified Anderson-Björck (modAB) Root-Finding Algorithm
Preprint
- 27 March 2026
- preprint
- Published by MDPI AG in Preprints.org
Abstract
Modified Anderson-Björck’s method [1] is a new robust and efficient bracketing root finding algorithm. It combines bisection with Anderson-Björk’s method to achieve both fast performance and worst-case optimality. It relies on linearity check criteria for switching methods and uses Anderson-Björk corrections to overcome the fixed endpoint issue of false-position. Initial benchmarks of this method have shown certain performance advantages compared to other methods like Ridders, Brent and ITP. In this paper, we propose further improvements of the method and perform some additional analysis and benchmarks of its behavior and performance.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Modified Anderson-Bjork’s method for solving non-linear equations in structural mechanicsIOP Conference Series: Materials Science and Engineering, 2023
- An Enhancement of the Bisection Method Average Performance Preserving Minmax OptimalityACM Transactions on Mathematical Software, 2020
- Combined bracketing methods for solving nonlinear equationsApplied Mathematics Letters, 2012
- ROOT — An object oriented data analysis frameworkNuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment, 1997
- Bisection is optimalNumerische Mathematik, 1982
- A new algorithm for computing a single root of a real continuous functionIEEE Transactions on Circuits and Systems, 1979
- A new high order method of regula falsi type for computing a root of an equationBIT Numerical Mathematics, 1973
- The “Pegasus” method for computing the root of an equationBIT Numerical Mathematics, 1972
- 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