Robust Interpolation and Approximation for ${A(\B})}$ Functions on

Abstract : For the robust $H^\infty$ identification of linear shift-invariant systems from frequency responses, the so-called two-stage algorithms are widely used. If the second step of such algorithms is generally reduced to the resolution of a nonlinear Nehari extension problem, the first stage may lead to specific interpolation or approximation techniques depending on the nature of the available data (density, corruptness, distribution, \ldots). In this paper we present two approximation techniques. In section \ref{RobPolApp}, we study on a subset of the unit circle, the robust polynomial approximation based on a least-deviation problem. In section \ref{secJdlVP}, we generalize Partington's results about robust Jackson and de la Vallée Poussin polynomial approximation, to the case of non-equally spaced points densely distributed on a subset of the unite circle.
Type de document :
RR-2778, INRIA. 1996
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:04:29
Dernière modification le : samedi 27 janvier 2018 - 01:31:29
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:01:41



  • HAL Id : inria-00073914, version 1



Nabil Torkhani. Robust Interpolation and Approximation for ${A(\B})}$ Functions on. RR-2778, INRIA. 1996. 〈inria-00073914〉



Consultations de la notice


Téléchargements de fichiers