Related papers: Exact pointwise estimates for polynomial approxima…
We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…
For the filtering of peaks in periodic signals, we specify polynomial filters that are optimally localized in space. The space localization of functions having an expansion in terms of orthogonal polynomials is thereby measured by a…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…
One frequently needs to interpolate or approximate gradients on simplicial meshes. Unfortunately, there are very few explicit mathematical results governing the interpolation or approximation of vector-valued functions on Delaunay meshes in…
This paper considers the approximation of a monomial $x^n$ over the interval $[-1,1]$ by a lower-degree polynomial. This polynomial approximation can be easily computed analytically and is obtained by truncating the analytical Chebyshev…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
We obtain the strong asymptotics of multiple orthogonal polynomials which arise in a mixed type Hermite-Pad\'e approximation problem defined on a Nikishin system of functions. The results obtained allow to give exact estimates of the rate…
We analyze the polynomials $H_{n}^{r}(x)$ considered by Gould and Hopper, which generalize the classical Hermite polynomials. We present the main properties of $H_{n}^{r}(x)$ and derive asymptotic approximations for large values of $n$ from…
Consider a non-linear operator equation $x - K(x) = f$, where $f$ is a given function and $K$ is a Urysohn integral operator with Green's function type kernel defined on $L^\infty [0, 1]$. We apply approximation methods based on…
We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…
For a function $f$ that is piecewise analytic on a quasi-smooth arc $\mathcal{L}$ and any $0<\sigma<1$ we construct a sequence of "near-best" polynomials that converge at a rate $e^{-n^{\sigma}}$ at each point of analyticity of $f$ and are…
A multidimesional function $y(\vec r)$ defined by a sample of points $\{\vec r_i,y_i\}$ is approximated by a differentiable function $\widetilde y(\vec r)$. The problem is solved by using the Gauss-Hermite folding method developed in the…
In this paper, we prove that in the overparametrized regime, deep neural network provide universal approximations and can interpolate any data set, as long as the activation function is locally in $L^1(\RR)$ and not an affine function.…
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…
We study integration and $L^2$-approximation of functions of infinitely many variables in the following setting: The underlying function space is the countably infinite tensor product of univariate Hermite spaces and the probability measure…
We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…
Only a few numerical methods can treat boundary value problems on polygonal and polyhedral meshes. The BEM-based Finite Element Method is one of the new discretization strategies, which make use of and benefits from the flexibility of these…
We consider the problem of computing the partition function $\sum_x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\Bbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial $f$,…
We show that a recent interpolative new proof of the Bohnenblust--Hille inequality, when suitably handled, recovers its best known constants. This seems to be unexpectedly surprising since the known interpolative approaches only provide…
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…