Computing multiple roots of polynomials with improved accuracy.
Polynomials with multiple roots are a challenge for traditional root finding algorithms, as their accuracy and numerical stability can be severely affected.
This problem can be reduced by dividing the polynomial of interest, by the greatest common divisor or itself and its derivative. One can easily show that this results in a polynomial with non-multiple roots.
The proposed algorithm works as follows:
1. Divide the input polynomial by the greatest common factor of itself and its first derivative.
2. Find roots of resulting polynomial.
3. Finally, determine multiplicity of each root.
Cite As
Mauricio Martinez-Garcia (2024). Computing multiple roots of polynomials with improved accuracy. (https://www.mathworks.com/matlabcentral/fileexchange/56818-computing-multiple-roots-of-polynomials-with-improved-accuracy), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
- MATLAB > Mathematics > Elementary Math > Polynomials >
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |