Topic summary
Root finding
Extracted from the Wikipedia article Root-finding algorithm.
See also
- List of root finding algorithms
- Fixed-point computation
- Broyden's method – Quasi-Newton root-finding method for the multivariable case
- Cryptographically secure pseudorandom number generator – Type of functions designed for being unsolvable by root-finding algorithms
- GNU Scientific Library
- Graeffe's method – Algorithm for finding polynomial roots
- Lill's method – Graphical method for the real roots of a polynomial
- MPSolve – Software for approximating the roots of a polynomial with arbitrarily high precision
- Multiplicity (mathematics) – Number of times an object must be counted for making true a general formula
- nth root algorithm
- System of polynomial equations – Roots of multiple multivariate polynomials
- Kantorovich theorem – About the convergence of Newton's method