Fast approximation of the H_ norm via optimization over spectral value sets
DOI10.1137/120875752zbMATH Open1271.93057OpenAlexW1984560319MaRDI QIDQ2848631FDOQ2848631
Authors: Mert Gürbüzbalaban, Michael L. Overton, Nicola Guglielmi 
Publication date: 26 September 2013
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/120875752
Recommendations
- A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
- A bisection method for computing the \(H_{\infty}\) norm of a transfer matrix and related problems
- Hybrid expansion-contraction: a robust scaleable method for approximating the \(H_{\infty}\) norm
- Calculating the \(H_{\infty}\)-norm using the implicit determinant method
- A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
stability radiustransfer matrixpseudospectralinear dynamical systems\(H_\infty\) normNewton-bisection methodspectral value setslarge and sparse systemsspectral value set abscissaspectral value set radiusstandard boyd-balakrishnan-bruinsma-steinbuch algorithm
Computational methods for sparse matrices (65F50) Large-scale problems in mathematical programming (90C06) Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalue problems (93B60) Linear systems in control theory (93C05) Discrete-time control/observation systems (93C55) Algebraic methods (93B25) Frequency-response methods in control theory (93C80)
Cited In (31)
- A subspace framework for \(\mathcal{H}_\infty \)-norm minimization
- A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
- A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
- SOBMOR: Structured Optimization-Based Model Order Reduction
- Calculating the \(H_{\infty}\)-norm using the implicit determinant method
- Large-scale estimation of dominant poles of a transfer function by an interpolatory framework
- Reinforced concrete seismically-excited frame design with a new mixed \(H_2/H_{\infty}\) optimization approach
- Characterization and computation of \({\mathcal H}_\infty\) norms for time-delay systems
- \(H_2\) optimal model order reduction of the discrete system on the product manifold
- Approximating the real structured stability radius with Frobenius-norm bounded perturbations
- Numerical computation and new output bounds for time-limited balanced truncation of discrete-time systems
- Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse
- Sensitivity analysis of random linear differential-algebraic equations using system norms
- Root-Max Problems, Hybrid Expansion-Contraction, and Quadratically Convergent Optimization of Passive Systems
- Large-scale and global maximization of the distance to instability
- Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
- Large-scale computation of \(\mathcal{L}_\infty\)-norms by a greedy subspace method
- Matrix Stabilization Using Differential Equations
- An iterative method for computing robustness of polynomial stability
- Fast iterative computation of optimal two-block H/sup infinity /-norm
- Approximation of stability radii for large-scale dissipative Hamiltonian systems
- Fixed-order H-infinity controller design for port-Hamiltonian systems
- Structured optimization-based model order reduction for parametric systems
- Stability and distance to instability for polynomial matrix families. Complex perturbations
- \(\mathcal{L}_{\infty}\)-norm computation for large-scale descriptor systems using structured iterative eigensolvers
- A novel iterative method to approximate structured singular values
- An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
- Numerically efficient \(H_\infty\) analysis of cooperative multi-agent systems
- Hybrid expansion-contraction: a robust scaleable method for approximating the \(H_{\infty}\) norm
- Calculating the H∞-norm of large sparse systems via Chandrasekhar iterations and extrapolation
- Faster and more accurate computation of the \(\mathcal{H}_\infty\) norm via optimization
Uses Software
This page was built for publication: Fast approximation of the \(H_\infty\) norm via optimization over spectral value sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848631)
