zbMATH — the first resource for mathematics

Saturation of positive convolution operators. (English) Zbl 0243.42024

42A38 Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type
41A40 Saturation in approximation theory
42A85 Convolution, factorization for one variable harmonic analysis
41A35 Approximation by operators (in particular, by integral operators)
Full Text: DOI
[1] Sunouchi, G; Watari, C, On determination of the saturation, (), 477-481 · Zbl 0086.05502
[2] Tureckiǐ, A.H, On classes of saturation for certain methods of summation of Fourier series of continuous periodic functions, Amer. math. soc. transl., 26, 263-272, (1963), (2) · Zbl 0125.31206
[3] Lorentz, G.G, Approximation of functions, (1968), Holt, Rinehart and Winston New York · Zbl 0186.10302
[4] Jackson, D, The theory of approximation, (), New York · JFM 56.0936.01
[5] Korovkin, P.P, Asymptotic properties of positive methods for summation of Fourier series, Uspehi mat. nauk., 15, No. 1(91), 207-212, (1960), (Russian) · Zbl 0107.05302
[6] Korovkin, P.P, Linear operator and approximation theory, (1960), Hindustan Publishing Corp Delhi · Zbl 0094.10201
[7] Curtis, P.C, The degree of approximation by positive convolution operators, Michigan math. J., 12, 155-160, (1965) · Zbl 0138.28502
[8] Shisha, O; Mond, B, The degree of approximation to periodic functions by linear positive operators, J. approximation theory, 1, 335-339, (1968) · Zbl 0169.39701
[9] Görlich, E; Stark, E.L, A unified approach to three problems on approximation by positive linear operators, () · Zbl 0233.41006
[10] Butzer, P.L; Görlich, E, Saturationsklassen und asymptotische eigenschaften trigonometrischer singulärer integrale, () · Zbl 0166.07102
[11] On approximation theory, ()
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.