Generalized Fourier series - Alchetron, the free social encyclopedia

In mathematical analysis, many generalizations of Fourier series have proved to be useful. They are all special cases of decompositions over an orthonormal basis of an inner product space. Here we consider that of square-integrable functions defined on an interval of the real line, which is important, among others, for interpolation theory.

Definition

Consider a set of square-integrable functions with values in F = C or R ,

Φ = { φ n : [ a , b ] → F } n = 0 ∞ ,

which are pairwise orthogonal for the inner product

⟨ f , g ⟩ w = ∫ a b f ( x ) g ¯ ( x ) w ( x ) d x

where w(x) is a weight function, and ⋅ ¯ represents complex conjugation, i.e. g ¯ ( x ) = g ( x ) for F = R .

The generalized Fourier series of a square-integrable function f: [a, b] → F , with respect to Φ, is then

f ( x ) ∼ ∑ n = 0 ∞ c n φ n ( x ) ,

where the coefficients are given by

c n = ⟨ f , φ n ⟩ w ∥ φ n ∥ w 2 .

If Φ is a complete set, i.e., an orthonormal basis of the space of all square-integrable functions on [a, b], as opposed to a smaller orthonormal set, the relation ∼ becomes equality in the L² sense, more precisely modulo |·|_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

and because of Sturm-Liouville theory, these polynomials are eigenfunctions of the problem and are solutions orthogonal with respect to the inner product above with unit weight. So 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 ) , c n = ⟨ f , P n ⟩ w ∥ P n ∥ w 2

As an example, let us calculate the Fourier–Legendre series for ƒ(x) = cos x over [−1, 1]. Now,

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

and a series involving these terms

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 ( 1 ) = ( 45 2 cos ⁡ 1 − 15 sin ⁡ 1 ) x 2 + 6 sin ⁡ 1 − 15 2 cos ⁡ 1

which differs from cos x by approximately 0.003, about 0. 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 include:

Bessel's inequality

∑ n = 0 ∞ | c n | 2 ≤ ∫ a b | f ( x ) | 2 d x .

Parseval's theorem

If Φ is a complete set,

∑ n = 0 ∞ | c n | 2 = ∫ a b | f ( x ) | 2 d x .

References

Generalized Fourier series Wikipedia

(Text) CC BY-SA