Pages that link to "Item:Q694553"

The following pages link to Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553):

Displaying 15 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)
• The computation of multiple roots of a polynomial (Q425345) (← links)
• Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
• The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
• The Sylvester and Bézout resultant matrices for blind image deconvolution (Q1799667) (← links)
• Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials (Q1950216) (← 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)
• Nearest common root of a set of polynomials: a structured singular value approach (Q2332430) (← links)
• A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials (Q2396283) (← 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)
• The Sylvester Resultant Matrix and Image Deblurring (Q2945991) (← links)
• The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)
• Numerical Analysis and Its Applications (Q5710620) (← links)