Conversion of descriptor representations to state-space form: an extension of the shuffle algorithm

DOI10.1080/00207179.2017.1336671zbMath1403.93103OpenAlexW2622866858MaRDI QIDQ4560987

Karl Heinz Kienitz, Sillas Hadjiloucas, Roberto Kawakami Harrop Galvão

Publication date: 10 December 2018

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

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

zbMATH Keywords

singular value decompositionstate-space modelsshuffle algorithmdescriptor representationsthree-dimensional RLC networks

Mathematics Subject Classification ID

Application models in control theory (93C95) Linear systems in control theory (93C05) Eigenvalues, singular values, and eigenvectors (15A18) Control/observation systems governed by ordinary differential equations (93C15)

Related Items

Analysis of the fractional descriptor discrete-time linear systems by the use of the shuffle algorithm

Cites Work

• Unnamed Item
• Analysis and design of descriptor linear systems
• Time-invariant descriptor systems
• On the computation of the fundamental subspaces for descriptor systems
• The linear-quadratic optimal regulator for descriptor systems
• Computation of transfer-function matrices of generalized state-space models
• Hessenberg-triangular reduction and transfer function matrices of singular systems
• Feedback and pole placement in descriptor variable Systems†
• Dynamic equations in descriptor form
• Fractional Order Modeling of Large Three-Dimensional RC Networks
• Fractional delayed damped Mathieu equation
• On the Lyapunov theorem for singular systems
• Synthesis of mechanical networks: the inerter
• <formula formulatype="inline"><tex Notation="TeX">${\cal L}_{\infty}$</tex></formula>-Norm Computation for Continuous-Time Descriptor Systems Using Structured Matrix Pencils