Brent's method is a hybrid root-finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation, giving it the reliability of bisection with the speed of the faster but less reliable methods. It tries the potentially fast-converging secant method or inverse quadratic interpolation first and falls back to bisection when necessary, and the method is due to Richard Brent, building on an earlier algorithm by Theodorus Dekker, so it is also known as the Brent-Dekker method.
Connections
Credited To
Source Brent's method (Wikipedia)
In Field
Source Brent's method (Wikipedia)
Invented By
Richard P. Brent published his root-finding algorithm combining bisection, the secant method and inverse quadratic interpolation in 1973.
Sources
Wikidata: Brent's Method
Wikidata Q905988, class allow-list match (w-wdresolver-0926)View the Source Brent's method (Wikipedia)
In Field: Computational Science, Lead sentence
Brent's method is a hybrid root-finding algorithm combining the bisection method, the secant method and inverse quadratic interpolation.
Credited To: Richard P. Brent, Lead paragraph
Brent's method is due to Richard Brent and builds on an earlier algorithm by Theodorus Dekker.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.