A new notion of equivalence for discrete time AR Representations

Content Provider	Semantic Scholar
Author	Karampetakis, Nikos P. Vologiannidis, Stavros Vardulakis, Antonis
Copyright Year	2004
Abstract	We present a new equivalence trasformation termed divisor equivalence, that has the property of preserving both the nite and the in nite elementary divisor structures of a square nonsingular polynomial matrix. This equivalence relation extends the known notion of strict equivalence [1], which dealt only with matrix pencils, to the general polynomial matrix case. It is proved that divisor equivalence characterizes in a closed form relation the equivalence classes of polynomial matrices that give rise to fundamentally equivalent discrete time auto-regressive representations as de ned in [2].
File Format	PDF HTM / HTML
Alternate Webpage(s)	https://pdfs.semanticscholar.org/c04f/8f70701ebd67faa315dfe91e39f12e788c69.pdf
Alternate Webpage(s)	http://anadrasis.math.auth.gr/karampet/Journals/32-IJC.pdf
Alternate Webpage(s)	http://anadrasis.web.auth.gr/svol/papers/IJC04.pdf
Language	English
Access Restriction	Open
Subject Keyword	Class Polynomial matrix Singular Structured Product Labeling Equivalence Codes Terminology Turing completeness
Content Type	Text
Resource Type	Article