English
Related papers

Related papers: Random points are optimal for the approximation of…

200 papers

Traditional measures of smoothness often fail to provide accurate $L_p$-error estimates for approximation by sampling or interpolation operators, especially for functions with low smoothness. To address this issue, we introduce a modified…

Numerical Analysis · Mathematics 2025-07-02 Yurii Kolomoitsev

We consider the problem of approximating an unknown function from point evaluations. This problem is a crucial subproblem in many modern (nonlinear) approximation schemes. When obtaining these point evaluations is costly, minimising the…

Numerical Analysis · Mathematics 2025-12-03 Philipp Trunschke , Anthony Nouy

For each $p>2$ we give intrinsic characterizations of the restriction of the homogeneous Sobolev space $L^1_p(R^2)$ to an arbitrary finite subset $E$ of $R^2$. The trace criterion is expressed in terms of certain weighted oscillations of…

Functional Analysis · Mathematics 2012-10-03 Pavel Shvartsman

We collect and extend results on the limit of $\sigma^{1-k}(1-\sigma)^k |v|_{l+\sigma,p,\Omega}^p$ as $\sigma$ tends to $0^+$ or $1^-$, where $\Omega$ is $\mathbb{R}^n$ or a smooth bounded domain, $k$ is 0 or 1, $l$ is a nonnegative…

Functional Analysis · Mathematics 2011-12-01 Rémi Arcangéli , Juan José Torrens

For probability distributions on $\mathbb{R}^n$, we study the optimal sample size N = N(n,p) that suffices to uniformly approximate the pth moments of all one-dimensional marginals. Under the assumption that the marginals have bounded 4p…

Probability · Mathematics 2014-05-21 Roman Vershynin

We approximate functions defined on smooth bounded domains by elements of the eigenspaces of the Laplacian or the Stokes operator in such a way that the approximations are bounded and converge in both Sobolev and Lebesgue spaces. We prove…

Functional Analysis · Mathematics 2021-08-05 Charles L. Fefferman , Karol W. Hajduk , James C. Robinson

Given an arbitrary planar $\infty$-harmonic function $u$, for each $\alpha>0$ we establish a quantitative local $W^{1,2}$-estimate of $|Du|^\alpha $, which is sharp as $\alpha\to0$. We also show that the distributional determinant of $u$ is…

Analysis of PDEs · Mathematics 2018-06-07 Herbert Koch , Yi Ru-Ya Zhang , Yuan Zhou

Bounds of the accuracy of the normal approximation to the distribution of a sum of independent random variables are improved under relaxed moment conditions, in particular, under the absence of moments of orders higher than the second.…

Probability · Mathematics 2015-07-06 V. Yu. Korolev , A. V. Dorofeeva

The recent developments of basis pursuit and compressed sensing seek to extract information from as few samples as possible. In such applications, since the number of samples is restricted, one should deploy the sampling points wisely. We…

Information Theory · Computer Science 2012-07-26 Rui Wang , Haizhang Zhang

This note demonstrates that it is possible to bound the expectation of an arbitrary norm of a random matrix drawn from the Stiefel manifold in terms of the expected norm of a standard Gaussian matrix with the same dimensions. A related…

Probability · Mathematics 2014-04-29 Joel A. Tropp

Suppose that $E \subset \mathbb{R}^{n+1}$ is a uniformly rectifiable set of codimension $1$. We show that every harmonic function is $\varepsilon$-approximable in $L^p(\Omega)$ for every $p \in (1,\infty)$, where $\Omega := \mathbb{R}^{n+1}…

Classical Analysis and ODEs · Mathematics 2019-05-20 Steve Hofmann , Olli Tapiola

Many randomized approximation algorithms operate by giving a procedure for simulating a random variable $X$ which has mean $\mu$ equal to the target answer, and a relative standard deviation bounded above by a known constant $c$. Examples…

Computation · Statistics 2019-08-16 Mark Huber

We study the problem of sampling an approximately uniformly random satisfying assignment for atomic constraint satisfaction problems i.e. where each constraint is violated by only one assignment to its variables. Let $p$ denote the maximum…

Data Structures and Algorithms · Computer Science 2021-02-17 Vishesh Jain , Huy Tuan Pham , Thuy-Duong Vuong

Let $\Omega\subset R^n$ be a bounded convex domain with $n\ge2$. Suppose that $A$ is uniformly elliptic and belongs to $W^{1,n}$ when $n\ge 3$ or $W^{1,q}$ for some $q>2$ when $n=2$. For $1<p<\infty$, we build up a global second order…

Analysis of PDEs · Mathematics 2022-07-14 Qianyun Miao , Fa Peng , Yuan Zhou

We consider the space of functions almost in $L_p$ and endow it with the topology of asymptotic $L_p$-convergence. This yields a completely metrizable topological vector space which, on finite measure spaces, coincides with the space of…

Functional Analysis · Mathematics 2025-12-01 Nuno J. Alves

We study approximation by arbitrary linear combinations of $n$ translates of a single function of periodic functions. We construct some methods of this approximation for functions in a class induced by the convolution with a given function,…

Numerical Analysis · Mathematics 2017-03-01 Dinh Dũng , Charles A. Micchelli , Vu Nhat Huy

This paper is concerned with an explicit value of the embedding constant from $W^{1,q}(\Omega)$ to $L^{p}(\Omega)$ for a bounded domain $\Omega\subset\mathbb{R}^N~(N\in\mathbb{N})$, where $1\leq q\leq p\leq \infty$. To obtain this value, we…

Functional Analysis · Mathematics 2016-09-19 Makoto Mizuguchi , Kazuaki Tanaka , Kouta Sekine , Shin'ichi Oishi

We prove $L^p$ boundedness results, $p > 2$, for local maximal averaging operators over a smooth 2D hypersurface $S$ with either a $C^1$ density function or a density function with a singularity that grows as $|(x,y)|^{-\beta}$ for $\beta <…

Classical Analysis and ODEs · Mathematics 2018-10-24 Michael Greenblatt

Functions in a Sobolev space are approximated directly by piecewise affine interpolation in the norm of the space. The proof is based on estimates for interpolations and does not rely on the density of smooth functions.

Functional Analysis · Mathematics 2014-11-11 Jean Van Schaftingen

Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…

Optimization and Control · Mathematics 2009-05-18 Jean B. Lasserre
‹ Prev 1 8 9 10 Next ›