Pages that link to "Item:Q611832"

The following pages link to The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832):

Displaying 14 items.

• The computation of multiple roots of a polynomial (Q425345) (← links)
• Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553) (← links)
• Structured matrix methods computing the greatest common divisor of polynomials (Q1678991) (← links)
• A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
• Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials (Q1950216) (← links)
• Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
• Structured matrix methods for the computation of multiple roots of a polynomial (Q2253088) (← links)
• Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients (Q2734415) (← links)
• (Q3456475) (← links)
• On the Greatest Common Divisor of the Value of Two Polynomials (Q4575264) (← links)
• Numerical Analysis and Its Applications (Q5710620) (← links)