Equivalence of AR‐representations in the light of the impulsive‐smooth behaviour
A.C. Pugh, Efstathios Antoniou, Nicholas P. Karampetakis
Abstract
A.C. Pugh, Efstathios Antoniou, Nicholas P. Karampetakis
Abstract
Abstract The paper presents a new notion of equivalence of non‐regular AR‐representations, based on the coincidence of the impulsive‐smooth behaviours of the underlying systems. The proposed equivalence is characterized by a special case of the usual unimodular equivalence and a restriction of the matrix transformation of full equivalence (Int. J. Control 1988; 47(1):53–64). Copyright © 2006 John Wiley & Sons, Ltd.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract The paper presents a new notion of equivalence of non‐regular AR‐representations, based on the coincidence of the impulsive‐smooth behaviours of the underlying systems. The proposed equivalence is characterized by a special case of the usual unimodular equivalence and a restriction of the matrix transformation of full equivalence (Int. J. Control 1988; 47(1):53–64). Copyright © 2006 John Wiley & Sons, Ltd.
Key concepts: Unimodular matrix, Equivalence (formal languages), Matrix equivalence, Coincidence, Mathematics, Pure mathematics, Transformation matrix, Equivalence relation