The computation of multiple roots of a polynomial
From MaRDI portal
Publication:425345
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
Cites work
- scientific article; zbMATH DE number 3839766 (Why is no real title available?)
- scientific article; zbMATH DE number 5168246 (Why is no real title available?)
- scientific article; zbMATH DE number 51361 (Why is no real title available?)
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1068190 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- A root-finding algorithm based on Newton's method
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Algorithm 835
- An algorithm for computing certified approximate GCD of n univariate polynomials
- An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
- Computation of approximate polynomial GCDs and an extension
- Computing multiple roots of inexact polynomials
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Generalizations of Laguerre’s Method: Higher Order Methods
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- MultRoot
- Numerical methods for roots of polynomials. Part I
- On the Problem of Runs
- Polynomial Scaling
- Solving a Polynomial Equation: Some History and Recent Progress
- Some modifications of Laguerre's method
- Structured Total Least Norm for Nonlinear Problems
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Total Least Norm Formulation and Solution for Structured Problems
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact 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
- A Bayesian model for root computation
- Algorithm 835
- 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
- scientific article; zbMATH DE number 2151210 (Why is no real title available?)
- Multiple roots of estimating functions
- Numerical calculation of the multiplicity of a solution to algebraic equations
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)
