Algorithm 835
Author:
Open Access
- 1 June 2004
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 30 (2) , 218-236
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.Keywords
This publication has 15 references indexed in Scilit:
- General polynomial roots and their multiplicities inO(N)memory andO(N2)Time∗Linear and Multilinear Algebra, 1999
- Solving a Polynomial Equation: Some History and Recent ProgressSIAM Review, 1997
- An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zerosJournal of Computational and Applied Mathematics, 1995
- Polynomial roots: The ultimate answer?Linear Algebra and its Applications, 1995
- Relationships between order and efficiency of a class of methods for multiple zeros of polynomialsJournal of Computational and Applied Mathematics, 1995
- A bibliography on roots of polynomialsJournal of Computational and Applied Mathematics, 1993
- Iterative methods for multiple zeros of a polynomial by clusteringJournal of Computational and Applied Mathematics, 1989
- Higher-order iteration functions for simultaneously approximating polynomial zerosInternational Journal of Computer Mathematics, 1983
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomialBIT Numerical Mathematics, 1975
- Principles for Testing Polynomial Zerofinding ProgramsACM Transactions on Mathematical Software, 1975