Bisected Direct Quadratic Regula Falsi

Robert G. Gottlieb, Blair F. Thompson · 2010

A new and powerful root finding algorithm that uses direct quadratic interpolation rather than inverse quadratic interpolation has been developed. The new method rapidly converges to the correct root without any need for sign checks or divide-by-zero checks. Numerical tests show the new direct method converges faster than other regula falsi root finding algorithms including Brent’s inverse quadratic approach.

Read the paper · More papers on PaperTik