AbstractSome explicit solutions to the 3 × 3 case of Agler's matrix equation for Nevanlinna-Pick interpolation on the bidisc are provided. Agler showed there exists a holomorphic function bounded by 1 on the bidisc D2 which maps n prescribed points in D2 to n prescribed points in D if and only if there exists a pair of n × n positive semidefinite matrices satisfying a certain matrix equation. We show there exists a solution to Agler's equation in which one matrix has a row and column of zeros if and only if an explicit set of inequalities that depend on the data are satisfied. A solution of this form is also equivalent to the existence of an interpolating function which is constant with respect to one coordinate of one bidisc data point. Th...
AbstractIn the present paper an intrinsic one-to-one correspondence between the (finite) multiple Ne...
AbstractWe show that if the Nevanlinna–Pick interpolation problem is solvable by a function mapping ...
AbstractThis paper deals with the matrix equation f(X)=A, where A∈Cn×n is a given matrix, and ƒ is a...
AbstractSome explicit solutions to the 3 × 3 case of Agler's matrix equation for Nevanlinna-Pick int...
Abstract. Recent results of Davidson-Paulsen-Raghupathi-Singh give neces-sary and sufficient conditi...
Recent results of Davidson-Paulsen-Raghupathi-Singh give necessary and sufficient conditions for the...
Recent results of Davidson-Paulsen-Raghupathi-Singh give necessary and sufficient conditions for the...
AbstractA matrix version of the boundary Nevanlinna-Pick interpolation problem in the class of Carat...
The Pick–Nevanlinna interpolation problem, in its fullest generality, is as follows: Given domains ...
We consider an interpolation problem of Nevanlinna-Pick type for matrix-valued Carathéodory function...
The Nevanlinna-Pick interpolation problem is studied in the class S(K) of meromorphic functions f wi...
The Nevanlinna-Pick interpolation problem is studied in the class S(K) of meromorphic functions f wi...
AbstractWe describe a computational method, known as the Nevanlinna algorithm, for the matrix-valued...
This Master's thesis will develops a modern approach to complex interpolation problems studied by Ca...
AbstractGiven a set of tangential interpolation conditions for a rational matrix function, one can a...
AbstractIn the present paper an intrinsic one-to-one correspondence between the (finite) multiple Ne...
AbstractWe show that if the Nevanlinna–Pick interpolation problem is solvable by a function mapping ...
AbstractThis paper deals with the matrix equation f(X)=A, where A∈Cn×n is a given matrix, and ƒ is a...
AbstractSome explicit solutions to the 3 × 3 case of Agler's matrix equation for Nevanlinna-Pick int...
Abstract. Recent results of Davidson-Paulsen-Raghupathi-Singh give neces-sary and sufficient conditi...
Recent results of Davidson-Paulsen-Raghupathi-Singh give necessary and sufficient conditions for the...
Recent results of Davidson-Paulsen-Raghupathi-Singh give necessary and sufficient conditions for the...
AbstractA matrix version of the boundary Nevanlinna-Pick interpolation problem in the class of Carat...
The Pick–Nevanlinna interpolation problem, in its fullest generality, is as follows: Given domains ...
We consider an interpolation problem of Nevanlinna-Pick type for matrix-valued Carathéodory function...
The Nevanlinna-Pick interpolation problem is studied in the class S(K) of meromorphic functions f wi...
The Nevanlinna-Pick interpolation problem is studied in the class S(K) of meromorphic functions f wi...
AbstractWe describe a computational method, known as the Nevanlinna algorithm, for the matrix-valued...
This Master's thesis will develops a modern approach to complex interpolation problems studied by Ca...
AbstractGiven a set of tangential interpolation conditions for a rational matrix function, one can a...
AbstractIn the present paper an intrinsic one-to-one correspondence between the (finite) multiple Ne...
AbstractWe show that if the Nevanlinna–Pick interpolation problem is solvable by a function mapping ...
AbstractThis paper deals with the matrix equation f(X)=A, where A∈Cn×n is a given matrix, and ƒ is a...