Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9498398 | Linear Algebra and its Applications | 2005 | 15 Pages |
Abstract
We propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F(s). The proposed method exploits the structure of the left null space of generalized Wolovich or Sylvester resultants to compute row polynomial vectors that form a minimal polynomial basis of left kernel of the given polynomial matrix. The entire procedure can be implemented using only orthogonal transformations of constant matrices and results to a minimal basis with orthonormal coefficients.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
E.N. Antoniou, A.I.G. Vardulakis, S. Vologiannidis,