A subspace-based method for solving Lagrange-Sylvester interpolation problems
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, cilt.29, sa.2, ss.377-395, 2007 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 29 Sayı: 2
- Basım Tarihi: 2007
- Doi Numarası: 10.1137/050622171
- Dergi Adı: SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.377-395
- Anahtar Kelimeler: rational interpolation, Lagrange-Sylvester, identification, subspace-based, FREQUENCY-RESPONSE DATA, RATIONAL INTERPOLATION, SYSTEM-IDENTIFICATION, OPTIMIZATION
- Anadolu Üniversitesi Adresli: Hayır
Özet
In this paper, we study the Lagrange-Sylvester interpolation of rational matrix functions which are analytic at infinity, and propose a new interpolation algorithm based on the recent subspace-based identification methods. The proposed algorithm is numerically efficient and delivers a minimal interpolant in state-space form. The solvability condition for the subspace-based algorithm is particularly simple and depends only on the total multiplicity of the interpolation nodes. As an application, we consider subspace-based system identification with interpolation constraints, which arises, for example, in the identification of continuous-time systems with a given relative degree.