Quick Search:

uzh logo
Browse by:
bullet
bullet
bullet
bullet

Zurich Open Repository and Archive 

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.

[img]
Preview
Accepted Version
PDF
1252Kb

Abstract

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.

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Institute of Mathematics
DDC:510 Mathematics
Language:English
Date:1999
Deposited On:11 Mar 2010 15:54
Last Modified:27 Nov 2013 23:47
Publisher:Elsevier
ISSN:0024-3795
Publisher DOI:10.1016/S0024-3795(98)10186-6
Citations:Web of Science®
Google Scholar™

Users (please log in): suggest update or correction for this item

Repository Staff Only: item control page