Related papers: Geometric Estimates in Interpolation by Linear Fun…

We establish best possible pointwise (up to a constant multiple) estimates for approximation, on a finite interval, by polynomials that satisfy finitely many (Hermite) interpolation conditions, and show that these estimates cannot be…

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…

Motivated by classical results of approximation theory, we define an Hermite-type interpolation in terms of $n$-dimensional subspaces of the space of $n$ times continuously differentiable functions. In the main result of this paper, we…

Let (B_0,B_1) be a Banach pair. Stafney showed that one can replace the space F(B_0,B_1) with its subspace G(B_0,B_1) in the definition of the norm in the Calderon complex interpolation method on the strip if the element belongs to the…

We study schemes for interpolating functions that take values in the special orthogonal group $SO(n)$. Our focus is on interpolation schemes obtained by embedding $SO(n)$ in a linear space, interpolating in the linear space, and mapping the…

Let $U^{n}$ be the unit polydisc of ${\Bbb C}^{n}$ and $\phi=(\phi_1, >..., \phi_n)$ a holomorphic self-map of $U^{n}.$ By ${\cal B}^p(U^{n})$, ${\cal B}^p_{0}(U^{n})$ and ${\cal B}^p_{0*}(U^{n})$ denote the $p$-Bloch space, Little…

An upper bound for the Lebesgue constant (the supremum norm) of the operator of interpolation of a function in equally spaced points of a triangle by a polynomial of total degree less than or equal to n is obtained. Earlier, the rate of…

Let $m,n\in\mathbb{N}$ and $p\in(0,\infty)$. For a finite dimensional quasi-normed space $X=(\mathbb{R}^m, \|\cdot\|_X)$, let $$B_p^n(X) = \Big\{ (x_1,\ldots,x_n)\in\big(\mathbb{R}^{m}\big)^n: \ \sum_{i=1}^n \|x_i\|_X^p \leq 1\Big\}.$$ We…

We consider the problem of uniform interpolation of functions with values in a complex inner product space of finite dimension. This problem can be casted within a modified weighted pluripotential theoretic framework. Indeed, in the…

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…

We propose a general theory of estimating interpolation error for smooth functions in two and three dimensions. In our theory, the error of interpolation is bound in terms of the diameter of a simplex and a geometric parameter. In the…

In this paper, we propose a method to learn a minimizing geodesic within a data manifold. Along the learned geodesic, our method can generate high-quality interpolations between two given data samples. Specifically, we use an autoencoder…

We prove the optimal convergence estimate for first order interpolants used in finite element methods based on three major approaches for generalizing barycentric interpolation functions to convex planar polygonal domains. The Wachspress…

We consider interpolation of univariate functions on arbitrary sets of nodes by Gaussian radial basis functions or by exponential functions. We derive closed-form expressions for the interpolation error based on the…

We construct interpolation operators for functions taking values in a symmetric space -- a smooth manifold with an inversion symmetry about every point. Key to our construction is the observation that every symmetric space can be realized…

We present a similarity transformation theory based on a polynomial form of a particle-hole pair excitation operator. In the weakly correlated limit, this polynomial becomes an exponential, leading to coupled cluster doubles. In the…

Convolution is an integral operation that defines how the shape of one function is modified by another function. This powerful concept forms the basis of hierarchical feature learning in deep neural networks. Although performing convolution…

We introduce a rotation-invariant representation of planar shapes. In particular, this representation encodes shapes as vectors such that the Euclidean distance between them serves as a valid shape distance. For standardized, star-shaped…

We establish simultaneous approximation properties of weighted first-order Sobolev orthogonal projectors onto spaces of polynomials of bounded total degree in the Euclidean unit ball. The simultaneity is in the sense that we provide bounds…

The Empirical Interpolation Method (EIM) is a greedy procedure that constructs approximate representations of two-variable functions in separated form. In its classical presentation, the two variables play a non-symmetric role. In this…