Generalized Fourier series

Decompositions of inner product spaces into orthonormal bases

In mathematics, a generalized Fourier series expands a square-integrable function defined on an interval of the real line. The constituent functions in the series expansion form an orthonormal basis of an inner product space. While a Fourier series expansion consists only of trigonometric functions, a generalized Fourier series is a decomposition involving any set of functions that satisfy the Sturm-Liouville eigenvalue problem. These expansions find common use in interpolation theory.[1]

Definition

Consider a set of square-integrable functions with values in F = C {\displaystyle \mathbb {F} =\mathbb {C} } or F = R {\displaystyle \mathbb {F} =\mathbb {R} } ,

Φ = { φ n : [ a , b ] F } n = 0 , {\displaystyle \Phi =\{\varphi _{n}:[a,b]\to \mathbb {F} \}_{n=0}^{\infty },}
which are pairwise orthogonal under the inner product
f , g w = a b f ( x ) g ¯ ( x ) w ( x ) d x , {\displaystyle \langle f,g\rangle _{w}=\int _{a}^{b}f(x)\,{\overline {g}}(x)\,w(x)\,dx,}
where w ( x ) {\displaystyle w(x)} is a weight function, and g ¯ {\displaystyle {\overline {g}}} represents complex conjugation, i.e., g ¯ ( x ) = g ( x ) {\displaystyle {\overline {g}}(x)=g(x)} for F = R {\displaystyle \mathbb {F} =\mathbb {R} }

The generalized Fourier series of a square-integrable function f : [ a , b ] F {\displaystyle f:[a,b]\to \mathbb {F} } , with respect to Φ, is then

f ( x ) n = 0 c n φ n ( x ) , {\displaystyle f(x)\sim \sum _{n=0}^{\infty }c_{n}\varphi _{n}(x),}
where the coefficients are given by
c n = f , φ n w φ n w 2 . {\displaystyle c_{n}={\langle f,\varphi _{n}\rangle _{w} \over \|\varphi _{n}\|_{w}^{2}}.}

If Φ is a complete set, i.e., an orthogonal basis of the space of all square-integrable functions on [a, b], as opposed to a smaller orthogonal set, the relation {\displaystyle \sim } becomes equality in the L2 sense, more precisely modulo | | w {\displaystyle |\cdot |_{w}} (not necessarily pointwise, nor almost everywhere).

Example (Fourier–Legendre series)

The Legendre polynomials are solutions to the Sturm–Liouville problem

( ( 1 x 2 ) P n ( x ) ) + n ( n + 1 ) P n ( x ) = 0. {\displaystyle \left((1-x^{2})P_{n}'(x)\right)'+n(n+1)P_{n}(x)=0.}

As a consequence of Sturm-Liouville theory, these polynomials are orthogonal eigenfunctions with respect to the inner product above with unit weight. We can form a generalized Fourier series (known as a Fourier–Legendre series) involving the Legendre polynomials, and

f ( x ) n = 0 c n P n ( x ) , {\displaystyle f(x)\sim \sum _{n=0}^{\infty }c_{n}P_{n}(x),}
c n = f , P n w P n w 2 {\displaystyle c_{n}={\langle f,P_{n}\rangle _{w} \over \|P_{n}\|_{w}^{2}}}

As an example, we may calculate the Fourier–Legendre series for f ( x ) = cos x {\displaystyle f(x)=\cos x} over [ 1 , 1 ] {\displaystyle [-1,1]} . We have that,

c 0 = 1 1 cos x d x 1 1 ( 1 ) 2 d x = sin 1 c 1 = 1 1 x cos x d x 1 1 x 2 d x = 0 2 / 3 = 0 c 2 = 1 1 3 x 2 1 2 cos x d x 1 1 9 x 4 6 x 2 + 1 4 d x = 6 cos 1 4 sin 1 2 / 5 {\displaystyle {\begin{aligned}c_{0}&={\int _{-1}^{1}\cos {x}\,dx \over \int _{-1}^{1}(1)^{2}\,dx}=\sin {1}\\c_{1}&={\int _{-1}^{1}x\cos {x}\,dx \over \int _{-1}^{1}x^{2}\,dx}={0 \over 2/3}=0\\c_{2}&={\int _{-1}^{1}{3x^{2}-1 \over 2}\cos {x}\,dx \over \int _{-1}^{1}{9x^{4}-6x^{2}+1 \over 4}\,dx}={6\cos {1}-4\sin {1} \over 2/5}\end{aligned}}}

and a series involving these terms would be

c 2 P 2 ( x ) + c 1 P 1 ( x ) + c 0 P 0 ( x ) = 5 2 ( 6 cos 1 4 sin 1 ) ( 3 x 2 1 2 ) + sin 1 = ( 45 2 cos 1 15 sin 1 ) x 2 + 6 sin 1 15 2 cos 1 {\displaystyle {\begin{aligned}c_{2}P_{2}(x)+c_{1}P_{1}(x)+c_{0}P_{0}(x)&={5 \over 2}(6\cos {1}-4\sin {1})\left({3x^{2}-1 \over 2}\right)+\sin 1\\&=\left({45 \over 2}\cos {1}-15\sin {1}\right)x^{2}+6\sin {1}-{15 \over 2}\cos {1}\end{aligned}}}

which differ from cos x {\displaystyle \cos x} by approximately 0.003. It may be advantageous to use such Fourier–Legendre series since the eigenfunctions are all polynomials and hence the integrals and thus the coefficients are easier to calculate.

Coefficient theorems

Some theorems on the coefficients c n {\displaystyle c_{n}} include:

Bessel's inequality

n = 0 | c n | 2 a b | f ( x ) | 2 w ( x ) d x . {\displaystyle \sum _{n=0}^{\infty }|c_{n}|^{2}\leq \int _{a}^{b}|f(x)|^{2}w(x)\,dx.}

Parseval's theorem

If Φ is a complete set, then

n = 0 | c n | 2 = a b | f ( x ) | 2 w ( x ) d x . {\displaystyle \sum _{n=0}^{\infty }|c_{n}|^{2}=\int _{a}^{b}|f(x)|^{2}w(x)\,dx.}

See also

References

  1. ^ Howell, Kenneth B. (2001-05-18). Principles of Fourier Analysis. Boca Raton: CRC Press. doi:10.1201/9781420036909. ISBN 978-0-429-12941-4.
  • https://mathworld.wolfram.com/GeneralizedFourierSeries.html