DocumentCode
321161
Title
The subspace Nevalinna interpolation problem and the most powerful unfalsified model
Author
Rapisarda, Paolo ; Willems, Jan C.
Author_Institution
Dept. of Electr., Electron. & Comput. Eng., Trieste Univ., Italy
Volume
3
fYear
1997
fDate
10-12 Dec 1997
Firstpage
2029
Abstract
A generalization of the tangential Nevanlinnna interpolation problem is studied from a behavioral point of view. Necessary and sufficient conditions for its solvability and a characterization of all its solutions are derived. These results are obtained by associating to the interpolation data a behavior that enjoys a special structure
Keywords
interpolation; polynomial matrices; most powerful unfalsified model; necessary and sufficient solvability conditions; subspace Nevalinna interpolation problem; tangential Nevanlinnna interpolation problem; Circuits; Electronic mail; Interpolation; Iterative algorithms; Mathematics; Polynomials; Power engineering and energy; Power engineering computing; Power system modeling; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1997., Proceedings of the 36th IEEE Conference on
Conference_Location
San Diego, CA
ISSN
0191-2216
Print_ISBN
0-7803-4187-2
Type
conf
DOI
10.1109/CDC.1997.657063
Filename
657063
Link To Document