Problems of saturation of linear methods (Q1174866): Difference between revisions
From MaRDI portal
Latest revision as of 11:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Problems of saturation of linear methods |
scientific article |
Statements
Problems of saturation of linear methods (English)
0 references
25 June 1992
0 references
For the \(\Lambda\)-method of summation of a Fourier series \[ U_ n(f,x,\Lambda)={a_ 0(f) \over 2\lambda_ 0^{(n)}} + \sum_{k=1}^ n \lambda_ k^{(n)}(a_ k(f) \cos kx+b_ k(f)\sin kx) \] the authors consider the corresponding saturation theorems. In particular, if there exists a positive function \(\varphi_ \Lambda\), tending monotonely to zero with \[ \lim_{n\to \infty}[(1-\lambda_ k^{(n)})/\varphi_ \Lambda(n)]=c/\psi(k), \psi(k), | c| >0, k\in \mathbb{N}, \lambda_ 0^{(n)}=1, \] then \(U_ n\) is saturated in \(X_{2\pi}\) with saturation order \(\varphi_ \Lambda(n)\), where \(X_{2\pi}=C_{2\pi}\) or \(L_{2\pi}^ p\), \(1\leq p<\infty\). Furthermore the saturation class is described as a function space depending on \(\psi\). More precisely, if \(\mu_ k^{(n)}=(1-\lambda_ k^{(n)})\psi(k)/\varphi(n), k,n\in \mathbb{N}\), \(\mu_ 0^{(n)}=1\), is a multiplier, uniformly bounded with respect to \(n\), of type \((L_{2\pi}^ p,L_{2\pi}^ p)\), \(1\leq p<\infty\), then the saturation class for \(X_{2\pi}=L_{2\pi}^ p\) consists for all functions \(f\in L_{2\pi}^ p\) with \[ \sum _{k=1}^ \infty {1 \over \psi(k)} (a_ k(f)\cos(kx)+b_ k(f)\sin(kx))\in L_{2\pi}^ p. \] Similar results hold for \(X_{2\pi}=L_{2\pi}^ \infty\) or \(BV_{2\pi}\). The authors remark that the uniform boundedness of the multipliers \(\mu_ k^{(n)}\) is equivalent to the uniform boundedness of \(\|\sum_{k=0}^{n-1} (1-{k \over n})\mu_ k^{(n)}\cos kx\| _ 1\). As an example some well-known summation methods are mentioned.
0 references
summation of a Fourier series
0 references
saturation theorems
0 references
multiplier
0 references
summation methods
0 references
0 references
0 references
0 references
0 references