The subspace Nevalinna interpolation problem and the most powerful unfalsified model

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.