Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Structured Matrix Methods Computing the Greatest Common Divisor of Polynomials

This paper revisits the Bézout, Sylvester, and power-basis matrix representations of the greatest common divisor (GCD) of sets of several polynomials. Furthermore, the present work introduces the application of the QR decomposition with column pivoting to a Bézout matrix achieving the computation of the degree and the coeffcients of the GCD through the range of the Bézout matrix. A comparison in terms of computational complexity and numerical effciency of the Bézout-QR, Sylvester-QR, and subspace-SVD...

Page 1

Download Results (CSV)