On computing the worst-case peak gain of linear systems
From MaRDI portal
Publication:1199846
DOI10.1016/0167-6911(92)90064-YzbMATH Open0778.93072OpenAlexW2178885914MaRDI QIDQ1199846FDOQ1199846
Authors: Venkataramanan Balakrishnan, Stephen Boyd
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
Recommendations
Cites Work
- Matrix Analysis
- Fast projection methods for minimal design problems in linear system theory
- Performance robustness of discrete-time systems with structured uncertainty
- 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
Cited In (12)
- Polyhedral estimation of \(\mathcal{L}_1\) and \(\mathcal{L}_\infty\) incremental gains of nonlinear systems
- Title not available (Why is that?)
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix
- Tight computationally efficient approximation of matrix norms with applications
- Minimization of the worst case peak-to-peak gain via dynamic programming: state feedback case
- Mixed ‐synthesis for ‐stability
- Computation of peak output for inputs satisfying many bounding conditions on magnitude and slope
- Maximal nonnegative perturbation of a nonnegative matrix
- Non-minimal factorization approach to the \(\ell_\infty\)-gain of discrete-time linear systems
- Time domain constrained \(H_{\infty }\)-synthesis
- On computing the worst-case norm of linear systems subject to inputs with magnitude bound and rate limit
- Computing the 1-norm of the impulse response of linear time-invariant systems
This page was built for publication: On computing the worst-case peak gain of linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199846)