相关论文: Degree of nearly comonotone approximation of perio…

Let $2s$ points $y_i=-\pi\le y_{2s}<\ldots<y_1<\pi$ be given. Using these points, we define the points $y_i$ for all integer indices $i$ by the equality $y_i=y_{i+2s}+2\pi$. We shall write $f\in\bigtriangleup^{(1)}(Y)$ if $f$ is a…

Suppose that a continuous on the real axis $2\pi$-periodic function $f$ changes its convexity at $2s,\ s\in\Bbb N,$ points $y_i$ on each period: $-\pi\le y_{2s}<y_{2s-1}<...<y_1<\pi,$ and for the rest $i\in\Bbb Z,$ the points $y_i$ are…

We give here the final results about the validity of Jackson-type estimates in comonotone approximation of $2\pi$-periodic functions by trigonometric polynomials. For coconvex and the so called co-$q$-monotone, $q>2$, approximations,…

We say that a function $f\in C[a,b]$ is $q$-monotone, $q\ge3$, if $f\in C^{q-2}(a,b)$ and $f^{(q-2)}$ is convex in $(a,b)$. Let $f$ be continuous and $2\pi$-periodic, and change its $q$-monotonicity finitely many times in $[-\pi,\pi]$. We…

It is not surprising that one should expect that the degree of constrained (shape preserving) approximation be worse than the degree of unconstrained approximation. However, it turns out that, in certain cases, these degrees are the same.…

A theorem of Hoischen states that given a positive continuous function $\varepsilon:\mathbb{R}\to\mathbb{R}$, an integer $n\geq 0$, and a closed discrete set $E\subseteq\mathbb{R}$, any $C^n$ function $f:\mathbb{R}\to\mathbb{R}$ can be…

About twenty years ago the measure of smoothness $\omega ^r_\phi (f,t)$ was introduced and related to the rate of polynomial approximation. In this article we survey developments about this and related concepts since that time.

Let $2s$ points $y_i=-\pi\le y_{2s}<\ldots<y_1<\pi$ be given. Using these points, we define the points $y_i$ for all integer indices $i$ by the equality $y_i=y_{i+2s}+2\pi$. We shall write $f\in\bigtriangleup^{(1)}(Y)$ if $f$ is a…

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…

We obtain the asymptotic equalities for the least upper bounds of approximations by interpolation trigonometric polynomials with the equidistant nodes $x_k^{(n-1)}=\frac{2k\pi}{2n-1},\ k\in\mathbb{Z},$ in metrics of the spaces $L_p$ on…

We obtain asymptotic estimates for the best approximations by trigonometric polynomials in the metric space $C$ $(L_p)$ of classes of periodic functions that can be represented as a convolution of kernels $\Psi_\beta$, which Fourier…

When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

For each $q\in{\mathbb{N}}_0$, we construct positive linear polynomial approximation operators $M_n$ that simultaneously preserve $k$-monotonicity for all $0\leq k\leq q$ and yield the estimate \[ |f(x)-M_n(f, x)| \leq c…

The paper is related to the following question of P.~L.~Ul'yanov: is it true that for any $2\pi$-periodic continuous function $f$ there is a uniformly convergent rearrangement of its trigonometric Fourier series? In particular, we give an…

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…

Given $k\in N$, a nonnegative function $f\in C^r[a,b]$, $r\ge 0$, an arbitrary finite collection of points $\big\{\alpha_i\big\}_{i\in J} \subset [a,b]$, and a corresponding collection of nonnegative integers $\big\{m_i\big\}_{i\in J}$ with…

We design a nonadaptive algorithm that, given oracle access to a function $f: \{0,1\}^n \to \{0,1\}$ which is $\alpha$-far from monotone, makes poly$(n, 1/\alpha)$ queries and returns an estimate that, with high probability, is an…

Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…

We present an analysis of the approximation error for a $d$-dimensional quasiperiodic function $f$ with Diophantine frequencies, approximated by a periodic function with the fundamental domain $[0,L_1)\times [0,L_2)\times \cdots…