Abstract
The objective of this paper is to establish an intrinsic and simple correspondence between a multiple Nevanlinna–Pick matrix interpolation (NP) problem in the Nevanlinna class N p with a denumerable set of nodes and a certain full Hamburger matrix moment problem. With the help of the indicated correspondence, the solution of an infinite NP problem in N p can be reduced to what amounts to the study of the associated full Hamburger matrix moment problem with the so-called block Hankel vector of the former, and vice versa. These investigations can be regarded as a natural extension of our previous work on both the NP problems with a finite set of interpolation data and the truncated power matrix moment problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
