×

zbMATH — the first resource for mathematics

Summation methods for Fourier series yielding best order of approximation. (English. Russian original) Zbl 0826.42007
Math. Notes 54, No. 2, 867-871 (1993); translation from Mat. Zametki 54, No. 2, 145-151 (1993).
The author examines the sequence of linear operators \(L_n (f)(x)={1\over\pi}\int^\pi_{- \pi} U_n (t - x) f(t)dt\), where \(U_n (s) = 1/2 + \sum^n_{k = 1} \lambda_{kn} \cos ks\), \(n \geq 1\), on the Banach space \(C_{2 \pi}\) of continuous \(2 \pi\)-periodic functions. By the method of decomposition of meromorphic functions a sequence \(U_n\), \(n \geq 1\), is constructed such that the order of approximation is exact (it is equal to \(1/n^{2m + 2})\) for each \(2(m + 2)\)-differentiable function \(f\) with bounded derivate \(f^{(2m + 2)}\).
MSC:
42A24 Summability and absolute summability of Fourier and trigonometric series
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] P. P. Korovkin, Usp. Mat. Nauk,17, No. 4, 147-152 (1962).
[2] P. P. Korovkin, in: Investigations on Modern Problems of the Constructive Theory of Functions [in Russian], Izd. Akad. Nauk Azerb. SSR, Baku (1965), pp. 163-166.
[3] A. I. Kovalenko, Mat. Sb.,71, No. 4, 598-616 (1966).
[4] J. Szabados, Acta Math. Acad. Sci. Hung.,27, No. 1-2, 179-192 (1976). · Zbl 0329.41017 · doi:10.1007/BF01896773
[5] P. L. Butzer and E. L. Stark, Acta Math. Acad. Sci. Hung.,20, No. 3-4, 451-461 (1969). · Zbl 0189.35001 · doi:10.1007/BF01894916
[6] V. A. Baskakov, Theory of Functions and Approximations [in Russian], Izd. Saratov Univ. (1984). · Zbl 0602.47007
[7] R. K. Vassiliev [Vasil’ev], Abstract, Second International Conference in Functional Analysis and Approximation Theory, Acquafredda di Maratea, Italy, September 14-19, 1992.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.