Faster and More Accurate Computation of the $\mathcal{H}_\infty$ Norm via Optimization

DOI10.1137/17M1137966zbMath1401.93087arXiv1707.02497MaRDI QIDQ4553790

Tim Mitchell, Peter Benner

Publication date: 31 October 2018

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.02497

zbMATH Keywords

robust controlHamiltoniandescriptor systemstransfer functions\(\mathcal{H}_\infty\)\(L_infty\) norm

Mathematics Subject Classification ID

Related Items (9)

Large-Scale Estimation of Dominant Poles of a Transfer Function by an Interpolatory Framework ⋮ Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation ⋮ Multifidelity Robust Controller Design with Gradient Sampling ⋮ Fast computation of \(\mathrm{sep}_\lambda\) via interpolation-based globality certificates ⋮ Approximation of stability radii for large-scale dissipative Hamiltonian systems ⋮ Sensitivity analysis of random linear differential-algebraic equations using system norms ⋮ Extended and Improved Criss-Cross Algorithms for Computing the Spectral Value Set Abscissa and Radius ⋮ Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations ⋮ On properties of univariate max functions at local maximizers

Uses Software

• HIFOO
• QDPA
• DPA_TDEFL
• Algorithm 961
• PSAPSR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm to compute the \(H_{\infty}\)-norm of a transfer function matrix
• A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its \(L_{\infty}\)-norm
• A bisection method for computing the \(H_{\infty}\) norm of a transfer matrix and related problems
• A structured pseudospectral method for \(\mathcal {H}_{\infty}\)-norm computation of large-scale descriptor systems
• On eigenvalues of matrices dependent on a parameter
• Fast Approximation of the $H_\infty$ Norm via Optimization over Spectral Value Sets
• Calculating the $H_{\infty}$-norm Using the Implicit Determinant Method
• Mathematical Systems Theory I
• Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
• A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
• Stability radii of linear discrete‐time systems and symplectic pencils
• An Algorithm for Computing the Distance to Instability
• Model Reduction and Approximation
• Approximating the Real Structured Stability Radius with Frobenius-Norm Bounded Perturbations
• Large-Scale Computation of $\mathcal{L}_\infty$-Norms by a Greedy Subspace Method
• Hybrid expansion–contraction: a robust scaleable method for approximating theH_∞norm
• Numerical Computation of Deflating Subspaces of Skew-Hamiltonian/Hamiltonian Pencils
• Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
• An Efficient Algorithm for Computing the ${\cal H}_{\infty}$ Norm
• <formula formulatype="inline"><tex Notation="TeX">${\cal L}_{\infty}$</tex></formula>-Norm Computation for Continuous-Time Descriptor Systems Using Structured Matrix Pencils
• Approximation of Large-Scale Dynamical Systems

This page was built for publication: Faster and More Accurate Computation of the $\mathcal{H}_\infty$ Norm via Optimization