Structured matrix methods for the computation of multiple roots of a polynomial

DOI10.1016/j.cam.2013.08.032zbMath1294.65053OpenAlexW1965339956MaRDI QIDQ2253088

Winkler, Joab R.

Publication date: 25 July 2014

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2013.08.032

zbMATH Keywords

algorithmnumerical examplesroots of polynomialsmultiple rootspolynomial deconvolutionstructured matrix methods

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Numerical computation of roots of polynomial equations (65H04)

Related Items (6)

Polynomial computations for blind image deconvolution ⋮ The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials ⋮ A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ The Sylvester and Bézout resultant matrices for blind image deconvolution ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial

Uses Software

• Matlab
• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• Polynomial GCD derived through monic polynomial subtractions
• The computation of multiple roots of a polynomial
• An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Method for finding multiple roots of polynomials
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• Polynomial Scaling
• Generalizations of Laguerre’s Method: Higher Order Methods
• Some modifications of Laguerre's method
• Computing multiple roots of inexact polynomials
• High Order Terms for Condition Estimation of Univariate Polynomials
• Algorithm 835
• A root-finding algorithm based on Newton's method

This page was built for publication: Structured matrix methods for the computation of multiple roots of a polynomial