= Jenkins–Traub algorithm
{wiki=Jenkins–Traub_algorithm}
The Jenkins–Traub algorithm is a numerical method used for finding the roots of polynomials. It is particularly effective for finding all the roots, including both real and complex roots, of a polynomial with real coefficients. The algorithm is notable for its efficiency and robustness. \#\#\# Key Features of Jenkins–Traub Algorithm: 1. **Root-Finding**: It finds all the roots of a polynomial in a systematic manner, starting from an initial guess and refining this guess iteratively.
Back to article page
