Related papers: Classical multivariate Hermite coordinate interpol…
Using a lemma of Davis on Gram matrices applied to the classical Orthogonal Polynomials to generate reproducing kernel interpolation over the classical domains for polynomials. These kernels have terms which are exact over the rational…
Properties of Hermitian forms are used to investigate several natural questions from CR Geometry. To each Hermitian symmetric polynomial we assign a Hermitian form. We study how the signature pairs of two Hermitian forms behave under the…
One of the possible variants of the classification of trigonometric interpolation splines is considered, depending on the chosen convergence factors, the distribution of signs of the basis functions and the interpolation factors. The…
We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from…
We first consider the problem of approximating a few eigenvalues of a rational matrix-valued function closest to a prescribed target. It is assumed that the proper rational part of the rational matrix-valued function is expressed in the…
We formulate the Bergman-type interpolation problem on finite open Riemann surfaces covered by the unit disk. Our version of the interpolation problem generalizes Bergman-type interpolation problems previously studied by Seip, Berntsson,…
The multigrid algorithm is an efficient numerical method for solving a variety of elliptic partial differential equations (PDEs). The method damps errors at progressively finer grid scales, resulting in faster convergence compared to…
We extend the univariate Newton interpolation algorithm to arbitrary spatial dimensions and for any choice of downward-closed polynomial space, while preserving its quadratic runtime and linear storage cost. The generalisation supports any…
Peak interpolation is concerned with a foundational kind of mathematical task: building functions in a fixed algebra $A$ which have prescribed values or behaviour on a fixed closed subset (or on several disjoint subsets). In this paper we…
The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…
In this paper we address the problem of constructing $G^2$ planar Pythagorean--hodograph (PH) spline curves, that interpolate points, tangent directions and curvatures, and have prescribed arc-length. The interpolation scheme is completely…
Finite difference discretization schemes preserving a subgroup of the maximal Lie invariance group of the one-dimensional linear heat equation are determined. These invariant schemes are constructed using the invariantization procedure for…
Nowadays, climate models rely on couplers. Each complete climate model is broken into different sub-models (oceanic, atmospheric,...), each one working on a different grid. The coupler brings these models together and interpolates the…
A corpus of recent work has revealed that the learned index can improve query performance while reducing the storage overhead. It potentially offers an opportunity to address the spatial query processing challenges caused by the surge in…
We present a semi-Lagrangian method for the numerical resolution of Vlasov-type equations on multi-patch meshes. Following N. Crouseilles et al. [A parallel Vlasov solver based on local cubic spline interpolation on patches. Journal of…
A new generalization of multiquadric functions $\phi(x)=\sqrt{c^{2d}+||x||^{2d}}$, where $x\in\mathbb{R}^n$, $c\in \mathbb{R}$, $d\in \mathbb{N}$, is presented to increase the accuracy of quasi-interpolation further. With the restriction to…
The one-dimensional real line of coordinates is replaced, for simplification or approximation purposes, by an N-plet of the so called Gauss-Hermite grid points. These grid points are interpreted as the eigenvalues of a tridiagonal matrix…
Under consideration methods of constructing trigonometric interpolation splines of two variables on rectangular areas. These methods are easily generalized to the case of trigonometric interpolation splines of several variables on such…
For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$, the polynomial interpolation problem (PIP) is to determine a unisolvent node set $P_{m,n} \subseteq \mathbb{R}^m$ of…
We present and analyze an approximation scheme for a class of highly oscillatory kernel functions, taking the 2D and 3D Helmholtz kernels as examples. The scheme is based on polynomial interpolation combined with suitable pre- and…