Related papers: Note on the best approximation in $L^1$ metric
We investigate the properties of minimizers of one-dimensional variational problems when the Lagrangian has no higher smoothness than continuity. An elementary approximation result is proved, but it is shown that this cannot be in general…
For a function $f$, continuous on a compact convex set $K$ and analytic in its interior we construct a sequence of almost optimal polynomials that converge with a geometric rate at points of analyticity of $f$.
In this paper, we propose a fully discrete soft thresholding trigonometric polynomial approximation on $[-\pi,\pi],$ named Lasso trigonometric interpolation. This approximation is an $\ell_1$-regularized discrete least squares approximation…
We survey the main results of approximation theory for adaptive piecewise polynomial functions. In such methods, the partition on which the piecewise polynomial approximation is defined is not fixed in advance, but adapted to the given…
Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…
We establish best possible pointwise (up to a constant multiple) estimates for approximation, on a finite interval, by polynomials that satisfy finitely many (Hermite) interpolation conditions, and show that these estimates cannot be…
Let $L^p(\mathbf{T})$ be the Lesbegue space of complex-valued functions defined in the unit circle $\mathbf{T}=\{z: |z|=1\}\subseteq \mathbb{C}$. In this paper, we address the problem of finding the best constant in the inequality of the…
The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…
We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…
We study the optimal rectangular-discrepancy approximation of permutons by finite permutations. We transfer bounds from discrepancy theory to this more restricted setup. Moreover, we show that superlinear approximation can occur only for…
Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…
This paper studies the asymptotic behavior of the exact constants of the Nikolskii inequalities for the space $\Pi_n^d$ of spherical polynomials of degree at most $n$ on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$ as…
In this work, we propose an interesting method that aims to approximate an activation function over some domain by polynomials of the presupposing low degree. The main idea behind this method can be seen as an extension of the ordinary…
We compute explicitely the best constants and, by solving some functional equations, we find all maximizers for homogeneous Strichartz estimates for the Schrodinger equation and for the wave equation in the cases when the Lebesgue exponent…
We calculate the least upper bounds for approximations in the metric of the space $L_2$ by linear methods of summation of Fourier series on classes of periodic functions $L^\psi_{\bar\beta,1}$ defined by sequences of multipliers…
We established exact in order estimates an approximation of the Sobolev classes $W^{\boldsymbol{r}}_{p,\boldsymbol{\alpha}}(\mathbb{T}^d)$ of periodic functions of many variables with a bounded dominating mixed derivative. The approximation…
Kolmogorov famously proved that multivariate continuous functions can be represented as a superposition of a small number of univariate continuous functions, $$ f(x_1,\dots,x_n) = \sum_{q=0}^{2n+1} \chi^q \left( \sum_{p=1}^n \psi^{pq}(x_p)…
In this paper we obtain quite general and definitive forms for Hardy-Littlewood type inequalities. Moreover, when restricted to the original particular cases, our approach provides much simpler and straightforward proofs and we are able to…
$\renewcommand{\Re}{\mathbb{R}}\newcommand{\eps}{{\varepsilon}}\newcommand{\poly}{\mathrm{poly}} $In this paper, we study the problem of $L_1$-fitting a shape to a set of $n$ points in $\Re^d$ (where $d$ is a fixed constant), where the…
We prove a multivariate Whitney type theorem for the local anisotropic polynomial approximation in $L_p(Q)$ with $1\leq p\leq \infty$. Here $Q$ is a $d$-parallelepiped in $\RR^d$ with sides parallel to the coordinate axes. We consider the…