Realization algorithms for systems over a principal ideal domain

R. Eising, M.L.J. Hautus

Research output: Book/ReportReportAcademic

93 Downloads (Pure)

Abstract

Abstract. In this paper realization algorithms for systems over a principal ideal domain are described. This is done using the Smith form or a modified Hermite form for matrices over a principal ideal domain. It is shown that Ho's algorithm and an algorithm due to Zeiger can be generalized to the ring case. Also a recursive realization algorithm, including some results concerning the partial realization problem, is presented. Applications to systems over the integers, delay differential systems and 2-D systems are discussed.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Hogeschool Eindhoven
Number of pages17
Publication statusPublished - 1978

Publication series

NameMemorandum COSOR
Volume7825
ISSN (Print)0926-4493

Fingerprint

Dive into the research topics of 'Realization algorithms for systems over a principal ideal domain'. Together they form a unique fingerprint.

Cite this