The following pages link to Template:Root-finding algorithms
External toolsShowing 28 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Newton's method (transclusion) (links | edit)
- Root-finding algorithm (transclusion) (links | edit)
- Secant method (transclusion) (links | edit)
- Bisection method (transclusion) (links | edit)
- Regula falsi (transclusion) (links | edit)
- Laguerre's method (transclusion) (links | edit)
- Brent's method (transclusion) (links | edit)
- Inverse quadratic interpolation (transclusion) (links | edit)
- Muller's method (transclusion) (links | edit)
- Lehmer–Schur algorithm (transclusion) (links | edit)
- Durand–Kerner method (transclusion) (links | edit)
- Splitting circle method (transclusion) (links | edit)
- Bairstow's method (transclusion) (links | edit)
- Graeffe's method (transclusion) (links | edit)
- Fixed-point iteration (transclusion) (links | edit)
- Aberth method (transclusion) (links | edit)
- Halley's method (transclusion) (links | edit)
- Broyden's method (transclusion) (links | edit)
- Jenkins–Traub algorithm (transclusion) (links | edit)
- Steffensen's method (transclusion) (links | edit)
- Ridders' method (transclusion) (links | edit)
- Sidi's generalized secant method (transclusion) (links | edit)
- Newton–Krylov method (transclusion) (links | edit)
- ITP method (transclusion) (links | edit)
- Polynomial root-finding (transclusion) (links | edit)
- Talk:Root-finding algorithm (links | edit)
- User:Glrx (links | edit)
- Template talk:Root-finding algorithms (transclusion) (links | edit)