OCSYSYDec 15, 2014

H infinity Analysis Revisited

arXiv:1412.61608 citations
Originality Synthesis-oriented
AI Analysis

For control theorists, this offers a simpler and more general approach to H-infinity norm calculation, though it is an incremental improvement over existing methods.

The paper presents a direct method for computing the H-infinity norm without requiring controllability, and provides a new proof of the Kalman-Yakubovich-Popov lemma using semidefinite programming duality.

This paper proposes a direct, and simple approach to the H infinity norm calculation in more general settings. In contrast to the method based on the Kalman-Yakubovich-Popov lemma, our approach does not require a controllability assumption, and returns a sinusoidal input that achieves the H infinity norm of the system including its frequency. In addition, using a semidefinite programming duality, we present a new proof of the Kalman- Yakubovich-Popov lemma, and make a connection between strong duality and controllability. Finally, we generalize our approach towards the generalized Kalman-Yakubovich-Popov lemma, which considers input signals within a finite spectrum.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes