The computation of multiple roots of a polynomial
type: Item
instance of: scholarly article
title: The computation of multiple roots of a polynomial
zbMATH Open document ID: 1243.65050
author: Xin Lao
author: Madina Hasan
author: Joab R. Winkler
published in: Journal of Computational and Applied Mathematics
publication date: 2012-06-08T00:00:00Z
Mathematics Subject Classification ID: 65H04
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 26C10
zbMATH DE Number: 6043617
zbMATH Keywords: roots of polynomials
zbMATH Keywords: computations on polynomials
zbMATH Keywords: numerical examples
zbMATH Keywords: structured matrix method
zbMATH Keywords: multiple roots
zbMATH Keywords: algorithms
cites work: MultRoot
cites work: Solving a Polynomial Equation: Some History and Recent Progress
cites work: Q4358561
cites work: Generalizations of Laguerre’s Method: Higher Order Methods
cites work: Some modifications of Laguerre's method
cites work: A root-finding algorithm based on Newton's method
cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
cites work: Numerical methods for roots of polynomials. Part I
cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder
cites work: On the Problem of Runs
cites work: Algorithm 835
cites work: Computing multiple roots of inexact polynomials
cites work: Total Least Norm Formulation and Solution for Structured Problems
cites work: Structured Total Least Norm for Nonlinear Problems
cites work: Q3309525
cites work: Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
cites work: A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
cites work: An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
cites work: Polynomial Scaling
cites work: The calculation of the degree of an approximate greatest common divisor of two polynomials
cites work: Q5689624
cites work: Q4001758
cites work: Q4227296
cites work: &lt;tex&gt;$QR$&lt;/tex&gt;Factoring to Compute the GCD of Univariate Approximate Polynomials
cites work: Q3447170
cites work: Computation of approximate polynomial GCDs and an extension
cites work: Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
cites work: Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
cites work: An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
describes a project that uses: MultRoot
describes a project that uses: na20
MaRDI profile type: Publication
full work available at URL: j.cam.2012.02.018
OpenAlex ID: W2017733277
DOI: 10.1016/J.CAM.2012.02.018
Recommended article: Computing multiple roots of inexact polynomials
Recommended article: Q4660677
Recommended article: Computers and the Multiplicity of Polynomial Roots
Recommended article: Method for finding multiple roots of polynomials
Recommended article: Q5314686
Recommended article: Q4004434
Recommended article: Simultaneous determination of polynomial roots and multiplicities: An algorithm and related problems
Recommended article: Q3543637
Recommended article: Multiplicity hunting and approximating multiple roots of polynomial systems
Recommended article: Numerical impluimentation of a new algorithm for polynomials with multiple roots
description: scientific article; zbMATH DE number 6043617