Pages that link to "Item:Q425345"

The following pages link to The computation of multiple roots of a polynomial (Q425345):

Displaying 16 items.

• Polynomial computations for blind image deconvolution (Q281962) (← links)
• The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (Q338517) (← links)
• A Bayesian model for root computation (Q626886) (← links)
• Root-finding by expansion with independent constraints (Q662237) (← links)
• Computation of dominant real roots of polynomials (Q840004) (← links)
• Computing values of a polynomial with only few multiplications (Q1313709) (← links)
• Ten methods to bound multiple roots of polynomials (Q1398714) (← links)
• The Sylvester and Bézout resultant matrices for blind image deconvolution (Q1799667) (← links)
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
• Structured matrix methods for the computation of multiple roots of a polynomial (Q2253088) (← links)
• Rayleigh quotient methods for estimating common roots of noisy univariate polynomials (Q2324359) (← links)
• A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials (Q2400326) (← links)
• Computers and the Multiplicity of Polynomial Roots (Q3327625) (← links)
• Numerical calculation of the multiplicity of a solution to algebraic equations (Q4372694) (← links)
• Multiple roots of estimating functions (Q4944647) (← links)
• The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)