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...
Main Authors: | Christou Dimitrios, Mitrouli Marilena, Triantafyllou Dimitrios |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2017-10-01
|
Series: | Special Matrices |
Subjects: | |
Online Access: | https://doi.org/10.1515/spma-2017-0015 |
Similar Items
-
Matrix Algebraic Properties of the Fisher Information Matrix of Stationary Processes
by: André Klein
Published: (2014-04-01) -
Geodetic networks of processing by singular decomposition of the configuration matrix
by: Weiss Gabriel
Published: (1996-12-01) -
Stabilization of Continuous-Time Adaptive Control Systems with Possible Input Saturation through a Controllable Modified Estimation Model
by: M. De la Sen
Published: (2004-01-01) -
A Structural Damage Identification Method Based on Unified Matrix Polynomial Approach and Subspace Analysis
by: Zhao, Wancheng
Published: (2008) -
An optimization method of observation matrix based on QR decomposition
by: Zhou Qibin, et al.
Published: (2021-04-01)