Related papers: Interpolation by generalized exponential sums with…

For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are…

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 prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…

Let $p$ be a large prime number and $g$ be any integer of multiplicative order $T$ modulo $p$. We obtain a new estimate of the double exponential sum $$ S=\sum_{n\in \mathcal{N}}\left|\sum_{m\in \mathcal{M} }e_p(an g^{m})\right|, \quad \gcd…

Let $\mathcal{M}$ be a semifinite von Neumann algebra equipped with a semifinite normal faithful trace $\tau$. Let $d$ be an injective positive measurable operator with respect to $(\mathcal{M}, \tau)$ such that $d^{-1}$ is also measurable.…

This paper presents a universal numerical scheme tailored for tackling linear integral, integro-differential, and both initial and boundary value problems of ordinary differential equations. The numerical scheme is readily adapted for…

Let $({\mathcal X}, d, \mu)$ be a metric measure space and satisfy the so-called upper doubling condition and the geometrically doubling condition. In this paper, the authors establish an interpolation result that a sublinear operator which…

Let ${\mathcal S}$ be the class of analytic functions $f$ in the unit disk ${\mathbb D}$ with $f({\mathbb D}) \subset \overline{\mathbb D}$. Fix pairwise distinct points $z_1,\ldots,z_{n+1}\in \mathbb{D}$ and corresponding interpolation…

Generalized polynomials are mappings obtained from the conventional polynomials by the use of operations of addition, multiplication and taking the integer part. Extending the classical theorem of H. Weyl on equidistribution of polynomials,…

Using elementary methods, we define and derive a particular weighted average of the trapezoidal and composite trapezoidal rules and show that this approximation, as well as its composite, is straightforward in computation. This…

Motivated by recent applications of weighted norm inequalities to maximal regularity of first and second order Cauchy problems, we study real interpolation spaces on the basis of general Banach function spaces and, in particular, weighted…

In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes. Our…

The problem of barycentric Hermite interpolation is highly susceptible to overflows or underflows. In this paper, based on Sturm-Liouville equations for Jacobi orthogonal polynomials, we consider the fast implementation on the second…

We obtain the inequality $$\int_{\Omega}|\nabla u(x)|^ph(u(x))dx\leq C(n,p)\int_{\Omega} \left( \sqrt{ |\nabla^{(2)} u(x)||{\cal T}_{h,C}(u(x))|}\right)^{p}h(u(x))dx,$$ where $\Omega\subseteq {\bf R}^n$ and $n\ge 2$, $u:\Omega\rightarrow…

The matrix code equivalence problem consists, given two matrix spaces $\mathcal{C},\mathcal{D} \subset \mathbb{F}_q^{m\times n}$ of dimension $k$, in finding invertible matrices $P\in\mathrm{GL}_m(\mathbb{F}_q)$ and…

We examine the interplay between projectivity (in the sense that was introduced by S.~Ghilardi) and uniform post-interpolant for the classical and intuitionistic propositional logic. More precisely, we explore whether a projective…

There are various generalizations of the geometric mean $(a,b)\mapsto a^{1/2}b^{1/2}$ for $a,b\in \mathbb{R}^+$ to positive matrices, and we consider the standard positive geometric mean $(X,Y)\mapsto…

When approximating a function that depends on a parameter, one encounters many practical examples where linear interpolation or linear approximation with respect to the parameters prove ineffective. This is particularly true for responses…

In this work we consider a model problem of deep neural learning, namely the learning of a given function when it is assumed that we have access to its point values on a finite set of points. The deep neural network interpolant is the the…

We use an interpolative technique from \cite{abps} to introduce the notion of multiple $N$-separately summing operators. Our approach extends and unifies some recent results; for instance we recover the best known estimates of the…