Category:Root-finding algorithms

• Root-finding algorithms (computing)

*

• Root-finding algorithm (computing)

A

• Aberth method (computing)
• Alpha max plus beta min algorithm (computing)
• Anderson acceleration (computing)

B

• Bailey's method (root finding) (computing)
• Bairstow's method (computing)
• Bisection method (computing)
• Brent's method (computing)
• Broyden's method (computing)
• Budan's theorem (computing)

C

• CORDIC (computing)

D

• Durand–Kerner method (computing)

F

• False position method (computing)
• Fast inverse square root (computing)
• Fixed-point iteration (computing)

G

• Graeffe's method (computing)
• Geometry of roots of real polynomials (computing)

H

• Halley's method (computing)
• Householder's method (computing)

I

• Illinois algorithm (computing)
• Integer square root (computing)
• Inverse quadratic interpolation (computing)

J

• Jenkins–Traub algorithm (computing)

L

• Laguerre's method (computing)
• Lehmer–Schur algorithm (computing)

M

• Methods of computing square roots (computing)
• Methods of successive approximation (computing)
• Muller's method (computing)

N

• Newton's method (computing)
• Nth root algorithm (computing)

R

• Rational root theorem (computing)
• Real-root isolation (computing)
• Regula falsi (computing)
• Ridders' method (computing)
• Root of a function (computing)
• Ruffini's rule (computing)

S

• Secant method (computing)
• Shifting nth root algorithm (computing)
• Sidi's generalized secant method (computing)
• Solving quadratic equations with continued fractions (computing)
• Splitting circle method (computing)
• Steffensen's method (computing)