Related papers: The three point Pick problem on the Bidisk
We study complex interpolation of variable Triebel-Lizorkin spaces, especially we present the complex interpolation of $F_{p(\cdot),q}^{\alpha }$ and $F_{p(\cdot ),p(\cdot )}^{\alpha (\cdot )}$ spaces. Also, some limiting cases are given.
In this paper, we investigate the problem of designing compact support interpolation kernels for a given class of signals. By using calculus of variations, we simplify the optimization problem from an infinite nonlinear problem to a finite…
Using algebraic methods, and motivated by the one variable case, we study a multipoint interpolation problem in the setting of several complex variables. The duality realized by the residue generator associated with an underlying Gorenstein…
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…
In a disk graph, every vertex corresponds to a disk in $\mathbb{R}^2$ and two vertices are connected by an edge whenever the two corresponding disks intersect. Disk graphs form an important class of geometric intersection graphs, which…
In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…
To the best of our knowledge this paper is the first attempt to introduce and study polynomial interpolation of the polynomial data given on arbitrary varieties. In the first part of the paper we present results on the solvability of such…
In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported…
Motivated by the recent progress of research on extending holomorphic functions defined on subvarieties of classical domains and its connections to the 3-point Pick interpolation, we study a special class of two-dimensional algebraic…
In this short note, we will give a generalization of the indefinite Schwarz-Pick inequality due to Seto [8]. Our approach is based on a connection between complex geometry and the geometry of reproducing kernel Hilbert spaces, which was…
This paper introduces the fractal interpolation problem defined over domains with a nonlinear partition. This setting generalizes known methodologies regarding fractal functions and provides a new holistic approach to fractal interpolation.…
Interpolation-based methods are well-established and effective approaches for the efficient generation of accurate reduced-order surrogate models. Common challenges for such methods are the automatic selection of good or even optimal…
The calculation of inclusive processes that involve the production of many particles is a challenge for lattice QCD, a Euclidean-space method that is far removed from real-time, multiparticle production. A new approach to this problem based…
We present a simple algorithm to select multivariate interpolation stencil with a Cartesian grid. We show its applicability by using this algorithm in the embedded boundary method for solving the elliptic interface problem.
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated…
We give exact and approximation algorithms for two-center problems when the input is a set $\mathcal{D}$ of disks in the plane. We first study the problem of finding two smallest congruent disks such that each disk in $\mathcal{D}$…
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
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…
This paper deals with solving a class of three-by-three block saddle point problems. The systems are solved by preconditioning techniques. Based on an iterative method, we construct a block upper triangular preconditioner. The convergence…