Pages that link to "Item:Q1678991"

The following pages link to Structured matrix methods computing the greatest common divisor of polynomials (Q1678991):

Displaying 8 items.

• Parallel QR processing of generalized Sylvester matrices (Q633629) (← links)
• The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← 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)
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases (Q2576217) (← links)
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients (Q2734415) (← links)
• Nearest common root of polynomials, approximate greatest common divisor and the structured singular value (Q5396892) (← links)
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies (Q5961649) (← links)
• Revisiting the Matrix Polynomial Greatest Common Divisor (Q6116668) (← links)