Abstract
1. Let X be a normed linear space of periodic functions (of period 2π), which includes the class of trigonometric polynomials. We restrict ourselves throughout to functions f ∈ X. Let D) = (dn, k) be the matrix of a regular sequence-to-sequence transformation. (We could also consider sequence-to-function transformations, in which case n is replaced by a continuous variable.) We suppose that, for all n,Let {Ln(x)} be the D transform of the Fourier series of f(x). If f(x) is a constant, it follows from (1) that, for all n, Ln(x) = f(x). However, it is often found that, roughly speaking, except in this trivial case, Ln(x) cannot tend to f(x) (in the topology given by the norm) with more than a certain degree of rapidity. This leads to the concept of ‘saturation’, which was first introduced by Favard (1) and Zamanski (8) and which has since been investigated by many authors (see (2), (3), (4), (5), (6), (7)). This is defined as follows.
Publisher
Cambridge University Press (CUP)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Degree of Approximation of Functions Through Summability Methods;Current Topics in Summability Theory and Applications;2016
2. Degree of Convergence for a Class of Linear Operators;Analytic and Geometric Inequalities and Applications;1999
3. On the monotonicity of saturation orders of saturated matrix methods;Journal of Approximation Theory;1989-02
4. On non-uniqueness of the order of saturation (II);Mathematical Proceedings of the Cambridge Philosophical Society;1984-07
5. Saturation results for a class of linear operators;Mathematical Proceedings of the Cambridge Philosophical Society;1983-07