Best \(L^1\) approximation of truncated functions, Whitney-type and Bohr-Favard-type inequalities (Q397023)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Best \(L^1\) approximation of truncated functions, Whitney-type and Bohr-Favard-type inequalities
scientific article

    Statements

    Best \(L^1\) approximation of truncated functions, Whitney-type and Bohr-Favard-type inequalities (English)
    0 references
    14 August 2014
    0 references
    In the first part, the paper gives some estimates with optimal constants of the best polynomial approximation in the space \(L_1[-1,1]\) of certain special truncated functions. The constructions are based on the Chebyshev polynomials of second kind. Based on these results, the author then gives an explicit representation of the optimal constant \(J_n\), which can appear in the Whitney-type inequality \(\| \frac G{\varphi^{n+1}} \|_{\infty}\leq J_n\| G^{(n+1)}\|_{\infty}\), where \(n\in\mathbb{N}\), \(\varphi(x)=\sqrt{1-x^2}\) and \(G\in C[-1,1]\) satisfies \(G^{(k)}(-1)=G^{(k)}(1)=0\), \(0\leq k\leq n\), \(G^{(n)}\in AC[-1,1]\) and \(G^{(n+1)}\in L^{\infty}[-1,1]\). Denote by \(E_n(f)_1\) the best polynomial approximation of order \(n\) of a function \(f\) in the space \(L_1[-1,1]\). The main theorem gives an estimate of the best possible constant \(C(n,1,1)\) in the inequality \(E_n(f)_1\leq C(n,1,1) \| \varphi^{n+1} f^{(n+1)}\|_1\), \(f\in L^1[-1,1]\), \(f^{(n)}\in AC[-1,1]\) and \(\varphi^{n+1} f^{(n+1)}\in L^1[-1,1]\). The existence of this constant and even of a more general constant was proved previously by \textit{Z. Ditzian} and \textit{V. Totik} in their book [Moduli of smoothness. New York etc.: Springer-Verlag (1987; Zbl 0666.41001)].
    0 references
    truncated function
    0 references
    Whitney-type inequality
    0 references
    best \(L^1\) approximation
    0 references
    best constants
    0 references
    Chebyshev polynomials of second kind
    0 references
    Bohr-Favard-type inequality
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references