Show simple item record

dc.contributor.authorBaras, John S.en_US
dc.contributor.authorMacEnany, David C.en_US
dc.contributor.authorMunach, R.L.en_US
dc.date.accessioned2007-05-23T09:45:13Z
dc.date.available2007-05-23T09:45:13Z
dc.date.issued1990en_US
dc.identifier.urihttp://hdl.handle.net/1903/4965
dc.description.abstractPolynomial matrices over fields and rings provide a unifying framework for many control system design problems. These include dynamic compensator design, infinite dimensional systems, controllers for nonlinear systems, and even controllers for discrete event systems. An important obstacle for utilizing these powerful mathematical tools in practical applications has been the non-availability of efficient and fast algorithms to carry through the precise error-free computations required by these algebraic methods. Recently, with the advent of computer algebra this has become possible. In this paper we develop highly efficient, error-free algorithms, for most of the important computations needed in linear systems over fields or rings. We show that the structure of the underlying rings and modules is critical in designing such algorithms. We also discuss the importance of such algorithms for controller synthesis.en_US
dc.format.extent1416422 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1990-14en_US
dc.subjectSystems Integrationen_US
dc.titleFast Error-Free Algorithms for Polynomial Matrix Computationsen_US
dc.typeTechnical Reporten_US
dc.contributor.departmentISRen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record