A note on computing polynomial filters for robust SPR of systems with polyhedral uncertainty

Abstract

This paper addresses the robust strict positive realness (RSPR) problem when the uncertain polynomial family is defined by an l/sub /spl infin// ball in coefficient space. A new characterization of the filters solving such problem is proposed. This characterization is exploited numerically to devise polynomial filters with guaranteed l/sub /spl infin// robustness margin.