Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-22116
Allen, B; Rosenthal, J (1999). A matrix Euclidean algorithm induced by state space realization. Linear Algebra and its Applications, 288(1-3):105-121.
View at publisher
An efficient algorithm is developed for determining the greatest common left divisor (GCLD) of two polynomial matrices. Knowing this divisor allows for several immediate applications. In coding theory, a noncatastrophic convolutional encoder can be derived from an arbitrary one. In systems theory, irreducible matrix fraction descriptions of transfer function matrices can be found. In linear algebra, the greatest common divisor can be seen as a basis for a free module generated by the columns of the matrices. The approach taken is based on recent ideas from systems theory. A minimal state space realization is obtained with minimal calculations, and from this the controllability matrix is analyzed to produce the GCLD. It will be shown that the derived algorithm is a natural extension of the Euclidean algorithm to the matrix case.
36 downloads since deposited on 11 Mar 2010
11 downloads since 12 months
|Item Type:||Journal Article, refereed, original work|
|Communities & Collections:||07 Faculty of Science > Institute of Mathematics|
|Dewey Decimal Classification:||510 Mathematics|
|Deposited On:||11 Mar 2010 14:54|
|Last Modified:||05 Apr 2016 13:26|
Users (please log in): suggest update or correction for this item
Repository Staff Only: item control page