English
Related papers

Related papers: Approximation by translates of a single function o…

200 papers

The paper study the discrete sets of translations of the Gaussian function that span the spaces L1(R) and L2(R).

Classical Analysis and ODEs · Mathematics 2008-12-03 Gerard Ascensi

Using a transference result, several inequalities of approximation by entire functions of exponential type in $\mathcal{C}(\mathbf{R})$, the class of bounded uniformly continuous functions defined on $\mathbf{R}:=\left( -\infty ,+\infty…

Classical Analysis and ODEs · Mathematics 2022-08-30 Ramazan Akgün

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

Numerical Analysis · Mathematics 2025-12-17 Álvaro Fernández Corral , Yahya Saleh

We study approximation of the embedding $\ell_p^m \rightarrow \ell_{\infty}^m$, $1 \leq p \leq 2$, based on randomized adaptive algorithms that use arbitrary linear functionals as information on a problem instance. We show upper bounds for…

Numerical Analysis · Mathematics 2024-08-05 Robert J. Kunsch , Marcin Wnuk

We consider upper bounds for the approximation error E|g(X)-g(\hat X)|^p, where X and \hat X are random variables such that \hat X is an approximation of X in the L_p-norm, and the function g belongs to certain function classes, which…

Probability · Mathematics 2007-12-24 Rainer Avikainen

We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise $\ell_p$-approximation error, for any $p \geq 1$; the case $p = 2$ is the classical SVD problem. We obtain the first provably good…

Data Structures and Algorithms · Computer Science 2017-05-19 Flavio Chierichetti , Sreenivas Gollapudi , Ravi Kumar , Silvio Lattanzi , Rina Panigrahy , David P. Woodruff

Having a function $f$ and a set of functionals $\{\mathcal{C}_{n}\}$, $c_n^f \equiv \mathcal{C}_n \left(f\right)$, one can interpret function approximation very generally as a construction of some function $\mathcal{A}_{N}^{f}$ such that…

General Mathematics · Mathematics 2022-03-22 Andrej Liptaj

We introduce Lipschitz continuous and $C^{1,1}$ geometric approximation and interpolation methods for sampled bounded uniformly continuous functions over compact sets and over complements of bounded open sets in $\mathbb{R}^n$ by using…

Metric Geometry · Mathematics 2016-09-29 Kewei Zhang , Elaine Crooks , Antonio Orlando

We study approximation properties of linear sampling operators in the spaces $L_p$ for $1\le p<\infty$. By means of the Steklov averages, we introduce a new measure of smoothness that simultaneously contains information on the smoothness of…

Classical Analysis and ODEs · Mathematics 2022-02-11 Yurii Kolomoitsev , Tetiana Lomako

Let $\mathcal{V}_p(\lambda)$ be the collection of all functions $f$ defined in the unit disc $\ID$ having a simple pole at $z=p$ where $0<p<1$ and analytic in $\ID\setminus\{p\}$ with $f(0)=0=f'(0)-1$ and satisfying the differential…

Complex Variables · Mathematics 2017-12-11 Bappaditya Bhowmik , Firdoshi Parveen

We derive fundamental lower bounds on the connectivity and the memory requirements of deep neural networks guaranteeing uniform approximation rates for arbitrary function classes in $L^2(\mathbb R^d)$. In other words, we establish a…

Machine Learning · Computer Science 2018-05-17 Helmut Bölcskei , Philipp Grohs , Gitta Kutyniok , Philipp Petersen

Let $X$ be an isotropic random vector in $R^d$ that satisfies that for every $v \in S^{d-1}$, $\|<X,v>\|_{L_q} \leq L \|<X,v>\|_{L_p}$ for some $q \geq 2p$. We show that for $0<\varepsilon<1$, a set of $N = c(p,q,\varepsilon) d$ random…

Probability · Mathematics 2020-08-20 Shahar Mendelson

Let $f$ be a continuous monotone real function defined on a compact interval $[a,b]$ of the real line. Given a sequence of partitions of $[a,b]$, $% \Delta_n $, $\left\Vert {\Delta }_{n}\right\Vert \rightarrow 0$, and given $l\geq 0,m\geq…

Numerical Analysis · Mathematics 2021-12-01 Donatella Bongiorno , Lucian Coroianu

The suitable basis functions for approximating periodic function are periodic, trigonometric functions. When the function is not periodic, a viable alternative is to consider polynomials as basis functions. In this paper we will point out…

Numerical Analysis · Mathematics 2013-01-01 Hillel Tal-Ezer

For given $p\in\lbrack1,\infty]$ and $g\in L^{p}\mathbb{(R)}$, we establish the existence and uniqueness of solutions $f\in L^{p}(\mathbb{R)}$, to the equation \[ f(x)-af(bx)=g(x), \] where $a\in\mathbb{R}$, $b\in\mathbb{R} \setminus…

Functional Analysis · Mathematics 2015-04-07 M. F. Barnsley , B. Harding , A. Vince , P. Viswanathan

We study the approximation of functions by tensor networks (TNs). We show that Lebesgue $L^p$-spaces in one dimension can be identified with tensor product spaces of arbitrary order through tensorization. We use this tensor product…

Functional Analysis · Mathematics 2024-06-26 Mazen Ali , Anthony Nouy

For any $p\in[1,\infty)$, we prove that the set of simple functions taking at most $k$ different values is proximinal in B\"ochner spaces $L^p(X)$ whenever $X$ is a dual Banach space with $w^*$-sequentially compact unit ball. With…

Functional Analysis · Mathematics 2024-04-24 Guillaume Grelier , Jaime San Martín

The paper proposes an approximate expression for calculating very complex one-dimensional integrals depending on the parameter $a$. These integrals often occur in computational problems theory of magnetic solitons. The resulting analytical…

General Physics · Physics 2023-02-27 D. Kovalenko , A. A. Zhmudsky

In this paper we introduce a family of rational approximations of the reciprocal of a $\phi$-function involved in the explicit solutions of certain linear differential equations, as well as in integration schemes evolving on manifolds. The…

Numerical Analysis · Mathematics 2021-05-18 Paola Boito , Yuli Eidelman , Luca Gemignani

We study the computational complexity of (deterministic or randomized) algorithms based on point samples for approximating or integrating functions that can be well approximated by neural networks. Such algorithms (most prominently…

Machine Learning · Computer Science 2021-04-08 Philipp Grohs , Felix Voigtlaender