2017/05/16 by А. Г. Бабенко, Babenko, A. G., Yu. V. Kryakin +1
Mathematics · Computer Science · #Approximation Theory and Sequence Spaces #Numerical Methods and Algorithms
paper · pdf · doi:10.48550/arxiv.1705.05614
We establish new estimates for the constant Ja(k,α) in the Brudnyi-Jackson inequality for approximation of f ∈ C[-1,1] by algebraic polynomials: Ena (f) ≤ Ja(k, α) ωk (f, απ/n ), αgt;0 The main result of the paper implies the following inequalities 1/2lt; Ja (2k, α) lt; 10, n ≥ 2k(2k-1), α≥ 2