Library of well known algorithms for numerical root finding.
Features
- Iterative approximation:
- Newton-Raphson method
- Secant method
- Regula falsi method (with Illinois modification)
- Brent-Dekker method
- Inverse quadratic approximation
- Recursive Sturm's method
- Solving polynomial equations
- Linear equation (editors' choice)
- Quadratic equation
- Cubic equation
- Quartic equation
- Eigenvalues method for higher-degree polynomials
Usage
extern crate roots;
use Roots;
use find_roots_cubic;
use find_root_brent;
use find_root_secant;
// Find the root of a complex function in the area determined by a simpler polynom