Algorithm 835: MultRoot---a Matlab package for computing polynomial roots and multiplicities

Authors:
Zhonggang Zeng
Affiliations:
Northeastern Illinois University, Chicago, IL
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2004

Citing 7
Cited 8

Iterative methods for multiple zeros of a polynomial by clustering

Journal of Computational and Applied Mathematics
A bibliography on roots of polynomials

Journal of Computational and Applied Mathematics
Remark on algorithms to find roots of polynomials

SIAM Journal on Scientific Computing
Relationships between order and efficiency of a class of methods for multiple zeros of polynomials

Proceedings of the international meeting on Linear/nonlinear iterative methods and verification of solution
An improved Sˇiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros

Journal of Computational and Applied Mathematics
Solving a Polynomial Equation: Some History and Recent Progress

SIAM Review
Principles for Testing Polynomial Zerofinding Programs

ACM Transactions on Mathematical Software (TOMS)

The approximate GCD of inexact polynomials

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set

Journal of Complexity
Numerical algebraic geometry and kinematics

Proceedings of the 2007 international workshop on Symbolic-numeric computation
Approximation of surface-to-surface intersection curves within a prescribed error bound satisfying G2 continuity

Computer-Aided Design
The approximate irreducible factorization of a univariate polynomial: revisited

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
The computation of multiple roots of a polynomial

Journal of Computational and Applied Mathematics
GCD of multivariate approximate polynomials using beautification with the subtractive algorithm

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Pseudospectra of exponential matrix polynomials

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

MultRoot is a collection of Matlab modules for accurate computation of polynomial roots, especially roots with non-trivial multiplicities. As a blackbox-type software, MultRoot requires the polynomial coefficients as the only input, and outputs the computed roots, multiplicities, backward error, estimated forward error, and the structure-preserving condition number. The most significant features of MultRoot are the multiplicity identification capability and high accuracy on multiple roots without using multiprecision arithmetic, even if the polynomial coefficients are inexact. A comprehensive test suite of polynomials that are collected from the literature is included for numerical experiments and performance comparison.