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...
| Published in: | Special Matrices |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2017-10-01
|
| Subjects: | |
| Online Access: | https://doi.org/10.1515/spma-2017-0015 |
