An Efficient Algorithm for Computing the {\cal H}_{\infty} Norm

DOI10.1109/TAC.2011.2122750MaRDI QIDQ5347777zbMATH OpenOpenAlexFDO

Authors Madhu N. Belur, C. Praagman

Publication date 25 August 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2011.2122750

Mathematics Subject Classification ID

(H^infty)-control (93B36)

Cited in

(7)

• On why using \(\mathbb{DL}(P)\) for the symmetric polynomial eigenvalue problem might need to be reconsidered
• Error estimation in reduced basis method for systems with time-varying and nonlinear boundary conditions
• Robust and nonlinear control literature survey (No. 26)
• Computing the norm ∥A∥∞,1 is NP-hard^∗
• Faster and more accurate computation of the \(\mathcal{H}_\infty\) norm via optimization
• Remark on Algorithm 539
• scientific article; zbMATH DE number 1445412 (Why is no real title available?)

This page was built for publication: An Efficient Algorithm for Computing the ${\cal H}_{\infty}$ Norm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347777)