The computation of multiple roots of a polynomial

DOI10.1016/J.CAM.2012.02.018zbMATH Open1243.65050OpenAlexW2017733277MaRDI QIDQ425345FDOQ425345

Authors: Xin Lao, Madina Hasan, Joab R. Winkler 

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

Recommendations

• Computing multiple roots of inexact polynomials
• scientific article; zbMATH DE number 2151210
• Computers and the Multiplicity of Polynomial Roots
• Method for finding multiple roots of polynomials
• scientific article; zbMATH DE number 2202629
• scientific article; zbMATH DE number 57425
• Simultaneous determination of polynomial roots and multiplicities: An algorithm and related problems
• Polynomial root-finding and polynomiography
• Multiplicity hunting and approximating multiple roots of polynomial systems
• Numerical impluimentation of a new algorithm for polynomials with multiple roots

zbMATH Keywords

algorithmsnumerical examplesmultiple rootsroots of polynomialscomputations on polynomialsstructured matrix method

Mathematics Subject Classification ID

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

Cites Work

• MultRoot
• Algorithm 835
• Design, analysis, and implementation of a multiprecision polynomial rootfinder
• Title not available (Why is that?)
• Numerical methods for roots of polynomials. Part I
• Title not available (Why is that?)
• Computation of approximate polynomial GCDs and an extension
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Structured Total Least Norm for Nonlinear Problems
• An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
• Total Least Norm Formulation and Solution for Structured Problems
• <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate 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
• Solving a Polynomial Equation: Some History and Recent Progress
• Polynomial Scaling
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Computing multiple roots of inexact polynomials
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Title not available (Why is that?)
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• Generalizations of Laguerre’s Method: Higher Order Methods
• Some modifications of Laguerre's method
• On the Problem of Runs
• A root-finding algorithm based on Newton's method
• The calculation of the degree of an approximate greatest common divisor of two polynomials

Cited In (19)

• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials
• Rayleigh quotient methods for estimating common roots of noisy univariate polynomials
• Computation of dominant real roots of polynomials
• Polynomial computations for blind image deconvolution
• Root-finding by expansion with independent constraints
• The computation of multiple roots of a Bernstein basis polynomial
• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
• The Sylvester and Bézout resultant matrices for blind image deconvolution
• Computing values of a polynomial with only few multiplications
• Ten methods to bound multiple roots of polynomials
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
• Algorithm 835
• A Bayesian model for root computation
• Structured matrix methods for the computation of multiple roots of a polynomial
• Computing multiple roots of inexact polynomials
• Computers and the Multiplicity of Polynomial Roots
• Title not available (Why is that?)
• Multiple roots of estimating functions
• Numerical calculation of the multiplicity of a solution to algebraic equations

Uses Software

• MultRoot
• na20

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425345)