
doi: 10.1007/bf02513138
Summary: We establish asymptotic equalities for upper bounds of approximations by Fourier sums and for the best approximations in the metrics \(C\) and \(L_1\) on classes of convolutions of periodic functions which can be regularly extended into a fixed strip of the complex plane.
asymptotic equalities, Convolution, factorization for one variable harmonic analysis, convolutions, Trigonometric approximation, Trigonometric polynomials, inequalities, extremal problems, Convergence and absolute convergence of Fourier and trigonometric series, Fourier approximation, upper bound, Fourier sums, Approximation in the complex plane, Best approximation, Chebyshev systems, uniform metric, integral metric, Kolmogorov-Nikol'skij problem, approximation, best approximation
asymptotic equalities, Convolution, factorization for one variable harmonic analysis, convolutions, Trigonometric approximation, Trigonometric polynomials, inequalities, extremal problems, Convergence and absolute convergence of Fourier and trigonometric series, Fourier approximation, upper bound, Fourier sums, Approximation in the complex plane, Best approximation, Chebyshev systems, uniform metric, integral metric, Kolmogorov-Nikol'skij problem, approximation, best approximation
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 6 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
