Reachability and controllability of discrete-time descriptor systems

DOI10.1080/00207179.2013.827798zbMath1317.93042OpenAlexW2021621364MaRDI QIDQ5265673

Anastasia Gregoriadou, Nicholas P. Karampetakis

Publication date: 28 July 2015

Published in: International Journal of Control (Search for Journal in Brave)

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

zbMATH Keywords

controllabilityreachabilitydescriptor systemsGramianfundamental matrix sequence

Mathematics Subject Classification ID

Controllability (93B05) Discrete-time control/observation systems (93C55) Attainable sets, reachability (93B03)

Related Items (2)

A fully actuated system approach for stabilization of discrete-time multiple-input nonlinear systems with distinct input delays ⋮ Observability of linear discrete-time systems of algebraic and difference equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Laurent expansion for a nearly singular matrix
• Fundamental, reachability, and observability matrices for discrete descriptor systems
• On the analysis of discrete linear time-invariant singular systems
• A further interpretation of inconsistent initial conditions in descriptor-variable systems
• Lyapunov-like equations and reachability/observabiliy Gramians for descriptor systems
• Solvability, controllability, and observability of continuous descriptor systems
• On the solution and impulsive behaviour of polynomial matrix descriptions of free linear multivariable systems
• Forward, backward, and symmetric solutions of discrete ARMA representations

This page was built for publication: Reachability and controllability of discrete-time descriptor systems