.png){kind=icon}
.png){kind=icon}
Return
L∞-Norm Computation for Continuous-Time Descriptor Systems Using Structured Matrix Pencils
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2011.2161833.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this technical note, we discuss an algorithm for the computation of the L-infinity-norm of transfer functions related to descriptor systems. We show how one can achieve this goal by computing the eigenvalues of certain skew-Hamiltonian/Hamiltonian matrix pencils and analyze arising problems. We also formulate and prove a theoretical result which serves as a basis for testing a transfer function matrix for properness. Finally, we illustrate our results using a descriptor system related to mechanical engineering.
Keywords:
Continuous time systems
H-infinity control
numerical stability
singular systems
skew-Hamiltonian/Hamiltonian matrix pencils
transfer function matrices
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W