Pages that link to "Polynomial root-finding algorithms"
Showing 35 items.
- Newton's method (links | edit)
- Root-finding algorithm (transclusion) (links | edit)
- Quintic function (links | edit)
- Secant method (links | edit)
- Bisection method (links | edit)
- Regula falsi (links | edit)
- Laguerre's method (links | edit)
- Brent's method (links | edit)
- Inverse quadratic interpolation (links | edit)
- Muller's method (links | edit)
- Lehmer–Schur algorithm (links | edit)
- Durand–Kerner method (links | edit)
- Splitting circle method (links | edit)
- Bairstow's method (links | edit)
- Factorization of polynomials (links | edit)
- Graeffe's method (links | edit)
- Fixed-point iteration (links | edit)
- Aberth method (links | edit)
- Halley's method (links | edit)
- Geometrical properties of polynomial roots (links | edit)
- Broyden's method (links | edit)
- Jenkins–Traub algorithm (links | edit)
- Steffensen's method (links | edit)
- MPSolve (links | edit)
- Ridders' method (links | edit)
- Sidi's generalized secant method (links | edit)
- Newton–Krylov method (links | edit)
- ITP method (links | edit)
- Polynomial root-finding (links | edit)
- Bernoulli's method (links | edit)
- Talk:Polynomial root-finding algorithms (transclusion) (links | edit)
- User:Lzxwuw/sandbox (links | edit)
- User talk:Fangong00 (links | edit)
- User talk:D.Lazard/Archive 4 (links | edit)
- Template:Root-finding algorithms (links | edit)