Structured Matrix Methods Computing the Greatest Common Divisor of Polynomials

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...

Full description

Bibliographic Details
Main Authors: Christou Dimitrios, Mitrouli Marilena, Triantafyllou Dimitrios
Format: Article
Language:English
Published: De Gruyter 2017-10-01
Series:Special Matrices
Subjects:
sylvester matrix
bézout matrix
qr decomposition
singular value decomposition
Online Access:https://doi.org/10.1515/spma-2017-0015

Internet

https://doi.org/10.1515/spma-2017-0015

Similar Items