Fundamental equivalence of discrete-time AR representations

DOI10.1080/0020717031000123607MaRDI QIDQ4459043zbMATH OpenOpenAlexFDO

Authors A. I. G. Vardulakis, Efstathios Antoniou

Publication date 25 March 2004

Full work available at URL https://doi.org/10.1080/0020717031000123607

zbMATH Keywords

autoregressive representationsbehaviordiscrete-time systemselementary divisor structurefundamental equivalencesquare polynomial matricesstrict equivalencetransformations

Mathematics Subject Classification ID

Transformations (93B17) Algebraic methods (93B25) Linear systems in control theory (93C05) Discrete-time control/observation systems (93C55)

Recommendations

• A new notion of equivalence for discrete time AR representations
• Publication:4731311
• Further observations concerning the strict system equivalence of polynomial system matrices over R[s, z ]
• Matrix pencil equivalents of a general polynomial matrix
• Strict system equivalence of 2D linear discrete state space models
• A fundamental notion of equivalence for linear multivariable systems
• scientific article; zbMATH DE number 5901745
• System Equivalence for Periodic Models and Systems
• Transformations of matrix pencils and implications in linear systems theory
• Solvability, reachability, controllability and observability of regular PMDs

Cited in

(5)

• The quadratic eigenvalue problem in electric power systems
• A class of discrete-time models for a continuous-time system
• A new notion of equivalence for discrete time AR representations
• Reachability of discrete time ARMA representations
• Parametrizing spectral filters for nonsingular polynomial matrices

This page was built for publication: Fundamental equivalence of discrete-time AR representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4459043)