On computing the worst-case peak gain of linear systems
From MaRDI portal
Publication:1199846
DOI10.1016/0167-6911(92)90064-YzbMath0778.93072OpenAlexW2178885914MaRDI QIDQ1199846
Stephen P. Boyd, Venkataramanan Balakrishnan
Publication date: 17 January 1993
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6911(92)90064-y
Related Items (8)
Non-minimal factorization approach to the \(\ell_\infty\)-gain of discrete-time linear systems ⋮ Mixed ‐synthesis for ‐stability ⋮ Tight computationally efficient approximation of matrix norms with applications ⋮ Polyhedral estimation of \(\mathcal{L}_1\) and \(\mathcal{L}_\infty\) incremental gains of nonlinear systems ⋮ Computing the 1-norm of the impulse response of linear time-invariant systems ⋮ Quadratic maximization of reachable values of affine systems with diagonalizable matrix ⋮ Time domain constrained H ∞ -synthesis ⋮ On computing the worst-case norm of linear systems subject to inputs with magnitude bound and rate limit
Cites Work
- A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
- Comparison of peak and RMS gains for discrete-time systems
- Fast projection methods for minimal design problems in linear system theory
- Matrix Analysis
- Performance robustness of discrete-time systems with structured uncertainty
This page was built for publication: On computing the worst-case peak gain of linear systems
