Related papers: Note on the best approximation in $L^1$ metric

The paper explores connection between the order and the type of an entire function and the speed of the best polynomial approximation in the unit disk. The relations which define the order and the type of an entire function through the…

Let $V\subset\R^m$ be a centrally symmetric convex body and let $V^*\subset\R^m$ be its polar. We prove limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities for algebraic polynomials…

Let $\Pi_n^d$ denote the space of spherical polynomials of degree at most $n$ on the unit sphere $\mathbb{S}^d\subset \mathbb{R}^{d+1}$ that is equipped with the surface Lebesgue measure $d\sigma$ normalized by $\int_{\mathbb{S}^d} \,…

Given a nonnegative polynomial f, we provide an explicit expression for its best $\ell_1$-norm approximation by a sum of squares of given degree.

A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…

Motivated by numerical methods for solving parametric partial differential equations, this paper studies the approximation of multivariate analytic functions by algebraic polynomials. We introduce various anisotropic model classes based on…

We describe polynomials of the best uniform approximation to sgn(x) on the union of two intervals in terms of special conformal mappings. This permits us to find the exact asymptotic behavior of the error of this approximation.

We provide a comprehensive study of interrelations between different measures of smoothness of functions on various domains and smoothness properties of approximation processes. Two general approaches to this problem have been developed:…

Given an approximately continuous function $f$ in an Orlicz space $L^\Phi([a,b]),$ for a suitable class of convex functions $\Phi,$ we employ a characterization of the best monotone approximation set to establish its continuity, which in…

We obtained order estimations for the best uniform approximations by trigonometric polynomials and approximations by Fourier sums of classes of $2\pi$-periodic continuous functions, which $(\psi,\beta)$-derivatives $f_{\beta}^{\psi}$ belong…

We obtain the estimates for the best approximation in the uniform metric of the classes of $2\pi $-periodic functions whose $(\psi ,\beta)$-derivatives have a given majorant $\omega$ of the modulus of continuity. It is shown that the…

Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…

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…

On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…

In this paper we give exact values of the best $n$-term approximation widths of diagonal operators between $\ell_p(\mathbb{N})$ and $\ell_q(\mathbb{N})$ with $0<p,q\leq \infty$. The result will be applied to obtain the asymptotic constants…

This paper presents a tractable algorithm for estimating an unknown Lipschitz function from noisy observations and establishes an upper bound on its convergence rate. The approach extends max-affine methods from convex shape-restricted…

In this paper we consider Lorentz space with a mixed norm of periodic functions of many variables. We obtain the exact estimation of the best M-term approximations of Nikol'ski's, Besov's classes in the Lorentz space with the mixed norm.

The paper deals with two fundamental types of trigonometric polynomials and splines on uniform grids, which allow us to construct interpolation approximations that depend linearly on the values of the interpolated function. Fundamental on…

Polynomial Krylov subspace methods are among the most widely used methods for approximating $f(A)b$, the action of a matrix function on a vector, in particular when $A$ is large and sparse. When $A$ is Hermitian positive definite, the…

We consider the problem of approximating an analytic function on a compact interval from its values at $M+1$ distinct points. When the points are equispaced, a recent result (the so-called impossibility theorem) has shown that the best…