The computation of multiple roots of a polynomial

DOI10.1016/J.CAM.2012.02.018zbMath1243.65050OpenAlexW2017733277MaRDI QIDQ425345

Madina Hasan, Xin Lao, Winkler, Joab R.

Publication date: 8 June 2012

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.2012.02.018

zbMATH Keywords

algorithmsnumerical examplesroots of polynomialsmultiple rootscomputations on polynomialsstructured matrix method

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04)

Related Items (8)

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 ⋮ Root-finding by expansion with independent constraints ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ Structured matrix methods for the computation of multiple roots of a polynomial ⋮ The Sylvester and Bézout resultant matrices for blind image deconvolution ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial

Uses Software

• MultRoot
• na20

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• MultRoot
• 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
• Numerical methods for roots of polynomials. Part I
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Computation of approximate polynomial GCDs and an extension
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• 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
• Structured Total Least Norm for Nonlinear Problems
• Solving a Polynomial Equation: Some History and Recent Progress
• On the Problem of Runs
• Computing multiple roots of inexact polynomials
• Total Least Norm Formulation and Solution for Structured Problems
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• Algorithm 835
• A root-finding algorithm based on Newton's method

This page was built for publication: The computation of multiple roots of a polynomial