Related papers: The three point Pick problem on the Bidisk
In this work, we study the Hermite interpolation on $n$-dimensional non-equally spaced, rectilinear grids over a field $\Bbbk $ of characteristic zero, given the values of the function at each point of the grid and the partial derivatives…
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…
Abstract. The Set Intersection Problem (SIP) is the problem of finding a point in the intersection of convex sets. This problem is typically solved by the method of alternating projections. To accelerate the convergence, the idea of using…
We develop an efficient reduced basis method for the frictional contact problem formulated using Nitsche's method. We focus on the regime of small deformations and on Tresca friction. The key idea ensuring the computational efficiency of…
Interpolation by various types of splines is the standard procedure in many applications. In this paper we shall discuss harmonic spline "interpolation" (on the lines of a grid) as an alternative to polynomial spline interpolation (at…
A seminal result of Agler characterizes the so-called Schur-Agler class of functions on the polydisk in terms of a unitary colligation transfer function representation. We generalize this to the unit ball of the algebra of multipliers for a…
Following the seminal work of Erlebach and van Leeuwen in SODA 2008, we introduce the minimum ply covering problem. Given a set $P$ of points and a set $S$ of geometric objects, both in the plane, our goal is to find a subset $S'$ of $S$…
Complete Pick algebras - these are, roughly, the multiplier algebras in which Pick's interpolation theorem holds true - have been the focus of much research in the last twenty years or so. All (irreducible) complete Pick algebras may be…
We present a local interpolation method in four dimensions utilising cubic splines. An extension of the three-dimensional tricubic method, the interpolated function has C$^1$ continuity and its partial derivatives are analytically…
We explore the topology of configuration spaces of hard disks experimentally, and show that several changes in the topology can already be observed with a small number of particles. The results illustrate a theorem of Baryshnikov, Bubenik,…
We present a novel approach to morph between two isometric poses of the same non-rigid object given as triangular meshes. We model the morphs as linear interpolations in a suitable shape space $\mathcal{S}$. For triangulated 3D polygons, we…
A mathematical model of the distribution function for the discrete 3-disk is proposed in order to utilize in the statistical evolution equation of the 3-dimensional Universe. The model distribution is constructed based on analyses in known…
Given a domain $\Omega$ in $\mathbb{C}^m$, and a finite set of points $z_1,\ldots, z_n\in \Omega$ and $w_1,\ldots, w_n\in \mathbb{D}$ (the open unit disc in the complex plane), the $Pick\, interpolation\, problem$ asks when there is a…
We introduce explicit families of good interpolation points for interpolation on a triangle in $\mathbb{R}^2$ that may be used for either polynomial interpolation or a certain rational interpolation for which we give explicit formulas.
Let $A$ be an arc on the boundary of the unit disk $U$. We prove an asymptotic formula for the probability that there is a percolation cluster $K$ for critical site percolation on the triangular grid in $U$ which intersects $A$ and such…
Given a disk O in the plane called the objective, we want to find n small disks P_1,...,P_n called the pupils such that $\bigcup_{i,j=1}^n P_i \ominus P_j \supseteq O$, where $\ominus$ denotes the Minkowski difference operator, while…
A certain kernel (sometimes called the Pick kernel) associated to Schur functions on the disk is always positive semi-definite. A generalization of this fact is well-known for Schur functions on the polydisk. In this article, we show that…
In the paper, the planar polynomial geometric interpolation of data points is revisited. Simple sufficient geometric conditions that imply the existence of the interpolant are derived in general. They require data points to be convex in a…
In this note we compute the number of general points through which a general Brill-Noether space curve passes.
We investigate an interpolation/extrapolation method that, given scattered observations of the Fourier transform, approximates its inverse. The interpolation algorithm takes advantage of modelling the available data via a shape-driven…