Computation of state reachable points of second order linear time-invariant descriptor systems

DOI10.13001/1081-3810.3303zbMATH Open1375.93055OpenAlexW2748746227MaRDI QIDQ4594682FDOQ4594682

Authors: Subashish Datta, Volker Mehrmann 

Publication date: 24 November 2017

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1fcc1186f515226f619075ddba4df6860066c23b

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A geometric characterization of the reachable and the controllable subspaces of descriptor systems
• Hybrid Systems: Computation and Control
• On the computation of the fundamental subspaces for descriptor systems
• On controlling generalized state-space (descriptor) systems
• Publication:3481556

zbMATH Keywords

reachabilitysecond order systemderivative arraylinear time-invariant descriptor systembehavior formulationstrangeness-free formulation

Mathematics Subject Classification ID

Controllability (93B05) Linear systems in control theory (93C05) Control/observation systems governed by ordinary differential equations (93C15)

Cited In (1)

• Numerical Linear Algebra Methods for Linear Differential-Algebraic Equations

Uses Software

• Simscape

This page was built for publication: Computation of state reachable points of second order linear time-invariant descriptor systems

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