Improvements to the Modified Anderson–Björck (modAB) Root-Finding Algorithm
Name
algorithms-19-00332-v2.pdf
Size
725.36 KB
Format
Adobe PDF
Checksum (MD5)
b84d2273c058b8cbdf294563ed1d320f
Author(s)
Ganchovski, Nedelcho
Smith, Oscar
Rackauckas, Christopher
Tomov, Lachezar
Traykov, Alexander
Date Issued
April 24, 2026
Journal
Algorithms
Publisher
MDPI
Citation
Ganchovski, N.; Smith, O.; Rackauckas, C.; Tomov, L.; Traykov, A. Improvements to the Modified Anderson–Björck (modAB) Root-Finding Algorithm. Algorithms 2026, 19, 332.
Version
Final published version
Abstract
The Modified Anderson–Björck method is a new, robust, and efficient bracketing root-finding algorithm. It combines bisection with the Anderson–Björk 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, such as Ridders, Brent and ITP. In this paper, we propose further improvements to this method and perform some additional analysis and benchmarks of its behavior and performance.
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.3390/a19050332
