Root-finding algorithm

A root-finding algorithm is a numerical method or algorithm of finding a value x such that F(x) = 0, for a given function F. Here, x may be a single real number or a vector. Root-finding algorithms are studied in numerical analysis.

Root-finding algorithms include:

• Newton's method
• Bisection
• Successive substitutions
• Secant Method
• False Position Method (Regula Falsi)
• Laguerre's Method
• Brent's Method
• Newton-Raphson Method
• Fixed-point iteration

External Links

• Numerical Recipes Homepage