This paper addresses the robust strict positive realness (RSPR) problem when the uncertain polynomial family is defined by an l∞ 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∞ robustness margin.

Bianchini, G. (2003). A note on computing polynomial filters for robust SPR of systems with polyhedral uncertainty. In Proc. of 42nd IEEE Conference on Decision and Control (pp.5017-5018). New York : IEEE [10.1109/CDC.2003.1272425].

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

BIANCHINI, GIANNI
2003-01-01

Abstract

This paper addresses the robust strict positive realness (RSPR) problem when the uncertain polynomial family is defined by an l∞ 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∞ robustness margin.
2003
0-7803-7924-1
Bianchini, G. (2003). A note on computing polynomial filters for robust SPR of systems with polyhedral uncertainty. In Proc. of 42nd IEEE Conference on Decision and Control (pp.5017-5018). New York : IEEE [10.1109/CDC.2003.1272425].
File in questo prodotto:
File Dimensione Formato  
A_note_on_computing_polynomial_filters_for_robust_SPR_of_systems_with_polyhedral_uncertainty.pdf

non disponibili

Tipologia: PDF editoriale
Licenza: NON PUBBLICO - Accesso privato/ristretto
Dimensione 175.57 kB
Formato Adobe PDF
175.57 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/442782