相关论文: Pick interpolation on the polydisc: small families…
We investigate the Pick problem for the polydisk and unit ball using dual algebra techniques. Some factorization results for Bergman spaces are used to describe a Pick theorem for any bounded region in $\mathbb{C}^d$.
We analyze the three point Pick interpolation problem on the bidisk
It is very elementary to observe that functions interpolating an extremal two-point Pick problem on the polydisc are just left inverses to complex geodesics. In the present article we show that the same property holds for a three-point Pick…
An abstract Pick interpolation theorem for a family of positive semi-definite kernels on a set $X$ is formulated. The result complements those in \cite{Ag} and \cite{AMbook} and will subsequently be applied to Pick interpolation on…
This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…
This article treats Nevanlinna-Pick interpolation in the setting of a special class of algebraic curves called distinguished varieties. An interpolation theorem, along with additional operator theoretic results, is given using a family of…
We show how Pick interpolation and interpolation on peak interpolation sets can be combined in an abstract uniform algebra setting. In particular as a special case, the Rudin-Carleson theorem can be combined with the classical Pick…
We give a characterization for the existence of a holomorphic interpolant on the unit polydisc $\mathbb{D}^n,$ $n\geq 2,$ for prescribed three-point Pick--Nevanlinna data. One of the key steps is a characterization for the existence of an…
The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…
A pattern of interpolation nodes on the disk is studied, for which the interpolation problem is theoretically unisolvent, and which renders a minimal numerical condition for the collocation matrix when the standard basis of Zernike…
In this paper we study two separate problems on interpolation. We first give some new equivalences of Stout's Theorem on necessary and sufficient conditions for a sequence of points to be an interpolating sequence on a finite open Riemann…
We give a new proof on the disk that a Pick problem can be solved by a rational function that is unimodular on the unit circle and for which the number of poles inside the disk is no more than the number of non-positive eigenvalues of the…
We give a solvability criterion for a special case of the $\mu$-synthesis problem. That is, we prove the necessity and sufficiency of a condition for the existence of an analytic $2 \times 2$ matrix-valued function on the disc subject to a…
Starting with a solvable Nevanlinna-Pick interpolation problem with the initial data coming from the symmetrized bidisk, this paper studies the corresponding uniqueness set, i.e., the largest set in the domain where all solutions to the…
We obtain necessary and sufficient conditions for Nevanlinna-Pick interpolation on the unit disk with the additional restriction that all analytic interpolating functions satisfy $f'(0)=0.$ Alternatively, these results can be interpreted as…
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
We consider scattered data approximation on product regions of equal and different dimensionality. On each of these regions, we assume quasi-uniform but unstructured data sites and construct optimal sparse grids for scattered data…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
In this paper we present an efficient algorithm for bivariate interpolation, which is based on the use of the partition of unity method for constructing a global interpolant. It is obtained by combining local radial basis function…