Identification and matrix rational $H^2$ approximation : a gradient algorithm based on Schur analysis

Abstract : This report deals with rational approximation of any specified order $n$ of transfer functions. Transfer functions are assumed to be matrices whose entries belong to the Hardy space for the complement of the closed unit disk endowed with the $L^2$-norm. A new approach is developed leading to an original algorithm, the first one to our knowledge which concerns matrix transfer functions. This approach generalizes the ideas developed in the scalar case, but involves substantial new difficulties. The inner-unstable factorization of transfer functions allows to express the criterion in terms of inner matrices of Mac-Millan degree $n$. These matrices form a differential manifold. Based on a tangential Schur algorithm, an atlas of this manifold is given for which the coordinates vary in $n$ copies of the unit ball. Then a gradient algorithm can be used to solve this problem. The different cases which can arise while processing the algorithm are studied~:~ how to switch to another chart of the atlas, what has to be done when a boundary point is reached. In the neighbourhood of a boundary point, the criterion can be smoothly extended. Moreover, such a point can be considered as an initial point for the research of a lower degree approximant. It is explained how to cope with the decrease and the increase of the degree. The convergence of the algorithm to a local minimum of appropriate degree is proved and demonstrated on a simple example.
Type de document :
RR-2520, INRIA. 1995
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:38:37
Dernière modification le : samedi 27 janvier 2018 - 01:31:33
Document(s) archivé(s) le : mardi 12 avril 2011 - 15:33:31



  • HAL Id : inria-00074158, version 1



Pascale Fulcheri, Martine Olivi. Identification and matrix rational $H^2$ approximation : a gradient algorithm based on Schur analysis. RR-2520, INRIA. 1995. 〈inria-00074158〉



Consultations de la notice


Téléchargements de fichiers