Related papers: Note on the best approximation in $L^1$ metric
We exploit the idea to use the maximal-entropy method, successfully tested in information theory and statistical thermodynamics, to determine approximating function's coefficients and squared errors' weights simultaneously as output of one…
We obtain order estimates for the best uniform orthogonal trigonometric approximations of $2\pi$-periodic functions, whose $(\psi,\beta)$-derivatives belong to unit balls of spaces $L_{p}, \ 1\leq p<\infty$, in case at consequences…
This paper deals with the approximation of discrete real-valued functions by first-degree splines (broken lines) with free knots for arbitrary $L_p$-norms ($1 \leq p \leq \infty)$. We prove the existence of best approximations und derive…
In this paper, we show that Besov and Triebel-Lizorkin functions can be approximated by a H\"older continuous function both in the Lusin sense and in norm. The results are proven in metric measure spaces for Haj{\l}asz-Besov and…
This work is a continuation of the recent study by the authors on approximation theory over the sphere and the ball. The main results define new Sobolev spaces on these domains and study polynomial approximations for functions in these…
In this paper we present results on asymptotic characteristics of multivariate function classes in the uniform norm. Our main interest is the approximation of functions with mixed smoothness parameter not larger than $1/2$. Our focus will…
We study the structure of the zeros of optimal polynomial approximants to reciprocals of functions in Hilbert spaces of analytic functions in the unit disk. In many instances, we find the minimum possible modulus of occurring zeros via a…
Recent findings by Jahn, T. Ullrich, Voigtlaender [10] relate non-linear sampling numbers for the square norm to quantities involving trigonometric best $m-$term approximation errors in the uniform norm. Here we establish new results for…
We study regression of $1$-Lipschitz functions under a log-concave measure $\mu$ on $\mathbb{R}^d$. We focus on the high-dimensional regime where the sample size $n$ is subexponential in $d$, in which distribution-free estimators are…
We obtain order estimates in the spaces $L_p$ of the best $n$-term trigonometric orthogonal approximations of the classes ${\cal F}_{q}^{\psi}$ of periodic functions, whose Fourier coefficients decrease faster then any power function. We…
Theoretical estimates of the convergence rate of many well-known gradient-type optimization methods are based on quadratic interpolation, provided that the Lipschitz condition for the gradient is satisfied. In this article we obtain a…
We construct Monte Carlo methods for the $L^2$-approximation in Hilbert spaces of multivariate functions sampling no more than $n$ function values of the target function. Their errors catch up with the rate of convergence and the…
We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of…
In this paper we find extremal one-sided approximations of exponential type for a class of truncated and odd functions with a certain exponential subordination. These approximations optimize the $L^1(\mathbb{R}, |E(x)|^{-2}dx)$-error, where…
The best polynomial approximation and Chebyshev approximation are both important in numerical analysis. In tradition, the best approximation is regarded as more better than the Chebyshev approximation, because it is usually considered in…
We introduce the Lipschitz matrix: a generalization of the scalar Lipschitz constant for functions with many inputs. Among the Lipschitz matrices compatible a particular function, we choose the smallest such matrix in the Frobenius norm to…
We obtain an estimate for uniform approximation rate of bounded analytic in the unit disk functions by logarithmic derivatives of $C$-polynomials, i.e., polynomials, all of whose zeros lie on the unit circle $C:|z|=1$.
The classical Jackson-Stechkin inequality estimates the value of the best uniform approximation of a periodic function by trigonometric polynomials of degree $\le n-1$ in terms of its $r$-th modulus of smoothness $\omega_r(f,\delta)$. The…
We compute the optimal constant for a generalized Hardy-Sobolev inequality, and using the product of two symmetrizations we present an elementary proof of the symmetries of some optimal functions. This inequality was motivated by a…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…