Namespaces
Variants
Actions

Difference between revisions of "Summation of Fourier series"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
(TeX)
 
Line 1: Line 1:
The construction of averages of [[Fourier series|Fourier series]] using [[Summation methods|summation methods]]. The best developed theory of the summation of Fourier series is that which uses the trigonometric system. In this case, for functions <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s0911601.png" /> with Fourier series
+
{{TEX|done}}
 +
The construction of averages of [[Fourier series|Fourier series]] using [[Summation methods|summation methods]]. The best developed theory of the summation of Fourier series is that which uses the trigonometric system. In this case, for functions $f\in L(0,2\pi)$ with Fourier series
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s0911602.png" /></td> </tr></table>
+
$$\frac{a_0}{2}+\sum_{k=1}^\infty(a_k\cos kx+b_k\sin kx)\equiv\sum_{k=0}^\infty A_k(x),$$
  
 
the properties of the averages corresponding to the summation method are studied. For example, for the [[Abel–Poisson summation method|Abel–Poisson summation method]], the averages are harmonic functions in the unit disc:
 
the properties of the averages corresponding to the summation method are studied. For example, for the [[Abel–Poisson summation method|Abel–Poisson summation method]], the averages are harmonic functions in the unit disc:
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s0911603.png" /></td> </tr></table>
+
$$f(r,x)=\sum_{k=0}^\infty r^kA_k(x),$$
  
 
while for the summation method of arithmetical averages (cf. [[Arithmetical averages, summation method of|Arithmetical averages, summation method of]]), they are the Fejér sums
 
while for the summation method of arithmetical averages (cf. [[Arithmetical averages, summation method of|Arithmetical averages, summation method of]]), they are the Fejér sums
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s0911604.png" /></td> </tr></table>
+
$$\sigma_n(x)=\sum_{k=0}^n\left(1-\frac{k}{n+1}\right)A_k(x).$$
  
Apart from these, the most important in the theory of one-dimensional trigonometric series are the [[Cesàro summation methods|Cesàro summation methods]], the [[Riesz summation method|Riesz summation method]], the [[Riemann summation method|Riemann summation method]], the [[Bernstein–Rogosinski summation method|Bernstein–Rogosinski summation method]], and the [[De la Vallée-Poussin summation method|de la Vallée-Poussin summation method]]. Summation methods that are generated by a more-or-less arbitrary sequence of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s0911605.png" />-multipliers
+
Apart from these, the most important in the theory of one-dimensional trigonometric series are the [[Cesàro summation methods|Cesàro summation methods]], the [[Riesz summation method|Riesz summation method]], the [[Riemann summation method|Riemann summation method]], the [[Bernstein–Rogosinski summation method|Bernstein–Rogosinski summation method]], and the [[De la Vallée-Poussin summation method|de la Vallée-Poussin summation method]]. Summation methods that are generated by a more-or-less arbitrary sequence of $\lambda$-multipliers
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s0911606.png" /></td> </tr></table>
+
$$\sum_{k=0}^\infty\lambda_{n,k}A_k(x)$$
  
 
have also been studied.
 
have also been studied.
Line 20: Line 21:
  
 
==Representations of functions using Fourier series.==
 
==Representations of functions using Fourier series.==
For example, the Abel–Poisson averages <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s0911607.png" />, when <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s0911608.png" />, and the Fejér sums <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s0911609.png" />, when <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116010.png" />, converge to the function <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116011.png" /> at its points of continuity; they converge moreover uniformly if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116012.png" /> is continuous at all points; for every function <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116013.png" />, these averages converge to the function in the metric of <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116014.png" /> and almost certainly. The partial sums of a Fourier series do not possess these properties.
+
For example, the Abel–Poisson averages $f(r,x)$, when $r\to1-0$, and the Fejér sums $\sigma_n(x)$, when $n\to\infty$, converge to the function $f(x)$ at its points of continuity; they converge moreover uniformly if $f$ is continuous at all points; for every function $f\in L$, these averages converge to the function in the metric of $L$ and almost certainly. The partial sums of a Fourier series do not possess these properties.
  
 
==Construction of polynomials with good approximation properties.==
 
==Construction of polynomials with good approximation properties.==
 
The [[Jackson inequality|Jackson inequality]] was established with the help of the summation of Fourier series. In order to solve this problem, as well as using known summation methods, new methods have been proposed, such as the [[Jackson singular integral|Jackson singular integral]] and the de la Vallée-Poussin sums (cf. [[De la Vallée-Poussin sum|de la Vallée-Poussin sum]]).
 
The [[Jackson inequality|Jackson inequality]] was established with the help of the summation of Fourier series. In order to solve this problem, as well as using known summation methods, new methods have been proposed, such as the [[Jackson singular integral|Jackson singular integral]] and the de la Vallée-Poussin sums (cf. [[De la Vallée-Poussin sum|de la Vallée-Poussin sum]]).
  
Many properties of functions can be characterized in terms of averages of Fourier series. For example, a function <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116015.png" /> is essentially bounded if and only if there exists a constant <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116016.png" /> such that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116017.png" /> for all <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116018.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/s/s091/s091160/s09116019.png" />.
+
Many properties of functions can be characterized in terms of averages of Fourier series. For example, a function $f$ is essentially bounded if and only if there exists a constant $M$ such that $|\sigma_n(x)|\leq M$ for all $n$ and $x$.
  
 
The summation of Fourier series plays an essential part in the theory of multiple trigonometric series. Thus, instead of spherical partial sums, their Riesz means of sufficiently high order are often used.
 
The summation of Fourier series plays an essential part in the theory of multiple trigonometric series. Thus, instead of spherical partial sums, their Riesz means of sufficiently high order are often used.

Latest revision as of 11:33, 2 September 2014

The construction of averages of Fourier series using summation methods. The best developed theory of the summation of Fourier series is that which uses the trigonometric system. In this case, for functions $f\in L(0,2\pi)$ with Fourier series

$$\frac{a_0}{2}+\sum_{k=1}^\infty(a_k\cos kx+b_k\sin kx)\equiv\sum_{k=0}^\infty A_k(x),$$

the properties of the averages corresponding to the summation method are studied. For example, for the Abel–Poisson summation method, the averages are harmonic functions in the unit disc:

$$f(r,x)=\sum_{k=0}^\infty r^kA_k(x),$$

while for the summation method of arithmetical averages (cf. Arithmetical averages, summation method of), they are the Fejér sums

$$\sigma_n(x)=\sum_{k=0}^n\left(1-\frac{k}{n+1}\right)A_k(x).$$

Apart from these, the most important in the theory of one-dimensional trigonometric series are the Cesàro summation methods, the Riesz summation method, the Riemann summation method, the Bernstein–Rogosinski summation method, and the de la Vallée-Poussin summation method. Summation methods that are generated by a more-or-less arbitrary sequence of $\lambda$-multipliers

$$\sum_{k=0}^\infty\lambda_{n,k}A_k(x)$$

have also been studied.

The summation of Fourier series is used in the following problems.

Representations of functions using Fourier series.

For example, the Abel–Poisson averages $f(r,x)$, when $r\to1-0$, and the Fejér sums $\sigma_n(x)$, when $n\to\infty$, converge to the function $f(x)$ at its points of continuity; they converge moreover uniformly if $f$ is continuous at all points; for every function $f\in L$, these averages converge to the function in the metric of $L$ and almost certainly. The partial sums of a Fourier series do not possess these properties.

Construction of polynomials with good approximation properties.

The Jackson inequality was established with the help of the summation of Fourier series. In order to solve this problem, as well as using known summation methods, new methods have been proposed, such as the Jackson singular integral and the de la Vallée-Poussin sums (cf. de la Vallée-Poussin sum).

Many properties of functions can be characterized in terms of averages of Fourier series. For example, a function $f$ is essentially bounded if and only if there exists a constant $M$ such that $|\sigma_n(x)|\leq M$ for all $n$ and $x$.

The summation of Fourier series plays an essential part in the theory of multiple trigonometric series. Thus, instead of spherical partial sums, their Riesz means of sufficiently high order are often used.

Summation of Fourier series is also examined with respect to other orthonormal systems of functions — both concrete systems and classes of systems, for example, orthogonal polynomials, as well as arbitrary orthonormal systems.

References

[1] N.K. [N.K. Bari] Bary, "A treatise on trigonometric series" , Pergamon (1964) (Translated from Russian)
[2] A. Zygmund, "Trigonometric series" , 1–2 , Cambridge Univ. Press (1988)
[3] G.H. Hardy, "Divergent series" , Clarendon Press (1949)
[4] S. Kaczmarz, H. Steinhaus, "Theorie der Orthogonalreihen" , Chelsea, reprint (1951)
[5] A.F. Timan, "Theory of approximation of functions of a real variable" , Pergamon (1963) (Translated from Russian)
How to Cite This Entry:
Summation of Fourier series. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Summation_of_Fourier_series&oldid=19045
This article was adapted from an original article by S.A. Telyakovskii (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article