Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
(EN)
Mitrouli, M
(EN)
Karcanias, N
(EN)
Koukouvinos, C
(EN)
This paper presents a new numerical algorithm for the computation of the greatest common divisor (GCD) of several polynomials, based on system-theoretic properties. The specific algorithm, characterizes the GCD as the output decoupling zero polynomial of an appropriate linear system associated with the given polynomial set. The computation of the GCD is thus reduced to specifying a nonzero entry of a vector forming the compound matrix of a matrix pencil directly produced from the associated linear system. A detailed description of the implementation of the algorithm is presented and analytical proofs of its stability are also developed. The MATLAB code of the algorithm is also described in the appendix.
(EN)
