# Boundary Value Problems/Lesson 4

Return to Boundary Value Problems

## Solution of a BVP[edit | edit source]

This page is copied from "http://en.wikiversity.org/wiki/Fourier_series"

The **Fourier series** is a mathematical tool used for analyzing periodic functions by decomposing such a function into a weighted sum of much simpler sinusoidal component functions sometimes referred to as **normal Fourier modes**, or simply **modes** for short. The weights, or coefficients, of the modes, are a one-to-one mapping of the original function. Generalizations include generalized Fourier series and other expansions over orthonormal bases.

Fourier series serve many useful purposes, as manipulation and conceptualization of the modal coefficients are often easier than with the original function. Areas of application include electrical engineering, vibration analysis, acoustics, optics, signal and image processing, and data compression. Using the tools and techniques of spectroscopy, for example, astronomers can deduce the chemical composition of a star by analyzing the frequency components, or spectrum, of the star's emitted light. Similarly, engineers can optimize the design of a telecommunications system using information about the spectral components of the data signal that the system will carry. *See also* spectrum analyzer.

The Fourier series is named after the French scientist and mathematician Joseph Fourier, who used them in his influential work on heat conduction, *Théorie Analytique de la Chaleur* (*The Analytical Theory of Heat*), published in 1822.

## Definition[edit | edit source]

### General form[edit | edit source]

Given a complex-valued function *f* of real argument *t*, *f*: **R** → **C**, where *f*(*t*) is piecewise smooth and continuous, periodic with period *T*, and square-integrable over the interval from to of length *T*, that is,

where

- is the period,
- and are integration bounds.

The **Fourier series expansion** of *f* is

where, for any non-negative integer *n*,

Equivalently, in complex exponential form,

where:

- is the imaginary unit, and
- in accordance with Euler's formula.

*For a formal justification, see Modern derivation of the Fourier coefficients below.*

### Canonical form[edit | edit source]

In the special case where the period *T* = 2π, we have

In this case, the Fourier series expansion reduces to a particularly simple form:

where

for any non-negative integer *n*.

or, equivalently:

where

### Choice of the form[edit | edit source]

The form for period *T* can be easily derived from the canonical one with the change of variable defined by . Therefore, both formulations are equivalent. However, the form for period *T* is used in most practical cases because it is directly applicable. For the theory, the canonical form is preferred because it is more elegant and easier to interpret mathematically, as will later be seen.

## Examples[edit | edit source]

### Simple Fourier series[edit | edit source]

Let *f* be periodic of period , with for *x* from −π to π. Note that this function is a periodic version of the identity function.

We will compute the Fourier coefficients for this function.

Notice that *a _{n}* are 0 because the are odd functions. Hence the Fourier series for this function is:

One application of this Fourier series is to compute the value of the Riemann zeta function at *s* = 2; by Parseval's theorem, we have:

which yields: .

## Modern derivation of the Fourier coefficients[edit | edit source]

The method used by Fourier to derive the coefficients of the series is very practical and well-suited to the problem he was dealing with (heat propagation). However, this method has since been generalized to a much wider class of problems: writing a function as a sum of periodic functions.

More precisely, if *f*:**R** → **C** is a function, we would like to write this function as a sum of trigonometric functions, i.e. . We have to restrict our choice of functions in order for this to make sense. First of all, if *f* has period *T*, then by changing variables, can study which has period 2π. This simplifies notations a lot and allows us to use a canonical (standard) form. We can restrict the study of to any interval of length 2π, [-π,π], say.

We will take the functions *f*:**R** → **C** in the set of piecewise continuous, 2π periodic functions with . Technically speaking, we are in fact taking functions from the Lp space *L*^{2}(μ), where μ is the normalized Lebesgue measure of the interval [-π,π] (i.e. such that .

### Complex Fourier coefficients[edit | edit source]

We can make *L*^{2}(μ) into a Hilbert space, which is well-suited for orthogonal projections, by defining the scalar product:

where denotes the conjugate of *f*(*x*). We will denote by the associated norm.

is an orthonormal basis of *L*^{2}(μ), which means we can write

We usually define . These numbers are called **complex Fourier coefficients**. Their expression is

An equivalent formulation is to write *f* as a sum of sine and cosine functions.

### Real Fourier coefficients[edit | edit source]

The sum in the previous section is symmetrical around 0: indeed, except for *n*=0, a *c*_{-n} coefficient corresponds to every *c*_{n} coefficient. This reminds one of the formulae

It is therefore possible to express the Fourier series with real-valued functions. To do this, we first notice that

After replacing *c*_{n} by its expression and simplifying the result we get

If, for a non-negative integer *n*, we define the **real Fourier coefficients** *a*_{n} and *b*_{n} by

we get:

### Properties[edit | edit source]

- The following properties can be easily derived from Euler's formula:

- If
*f*is an odd function, then for all because is then also odd, so its integral on is zero. If*f*is an even function, then for a similar reason.

- If
*f*is piecewise continuous, , , and

- If
*f*is*k*-times piecewise continuously differentiable, then we can easily compute the Fourier coefficients of given those of*f*:

where denotes the *k*th derivative of *f*.

- For any positive integer
*k*, if*f*is C^{k − 1}and piecewise C^{k}, then

- because

This means that the sequence is rapidly decreasing.

### General case[edit | edit source]

Fourier series take advantage of the periodicity of a function *f* but what if *f* is periodic in more than one variable, or for that matter, what if *f* is not periodic? These problems led mathematicians and theoretical physicists to try to define Fourier series on any group *G*. The advantage of this is that it allows us, for example, to define Fourier series for functions of several variables. Fourier series and Fourier transforms usually used in signal processing then become special cases of this theory and are easier to interpret.

If *G* is a locally compact Abelian group and **T** is the unit circle, we can define the dual of *G* by . This is the set of rotations on the unit circle and its elements are called characters. We can define a scalar product on **C**[*G*] by: . is then an orthonormal basis of **C**[*G*] with respect to this scalar product. Let *f* :*G* → **C**. The Fourier coefficients of *f* are defined by: and we have . If the group is discrete, then the integral reduces to an ordinary sum.

For example, the Fourier series of this article are obtained by taking *G*=**R**/2π**Z**. We get

and

Periodic functions in *n* dimensions can be defined on an *n*-dimensional torus (the function taking a value at each point on the torus). Such a torus is defined by **T**^{n}=**R**^{n}/(2π**Z**)^{n}. For *n*=1 we get a circle, for *n*=2 the cartesian product of two circles, i.e. a torus in the usual sense. Choosing *G*=**T**^{n} gives the corresponding Fourier series.

## Approximation and convergence of Fourier series[edit | edit source]

### Definition of a Fourier series[edit | edit source]

Let . We call **Fourier series of the function** *f* the series . For any positive integer *N*, we call the **N-th partial sum** of the Fourier series of this function.

### Approximation with the partial sums[edit | edit source]

Say we want to find the best approximation of *f* using only the functions for *n* from to *N*. Let . We are trying to find coefficients such that is minimum (where denotes the norm).

We have , where Re(*z*) denotes the real part of *z*.

Parseval's theorem (which can be derived independently from Fourier series) gives us

By definition, ; therefore

It is clear that this expression is minimum for and for this value only.

This means that there is one and only one such that

it is given by

where

This means that the best approximation of *f* we can make using only the functions for *n* from to *N* is precisely the *N*th partial sum of the Fourier series. An illustration of this is given on the animated plot of example 1.

### Convergence[edit | edit source]

While the **Fourier coefficients** *a*_{n} and *b*_{n} can be formally defined for any function for which the integrals make sense, whether the series so defined actually converges to *f*(*x*) depends on the properties of *f*.

The simplest answer is that if *f* is square-integrable then

This is convergence in the norm of the space *L*^{2}. The proof of this result is simple, unlike Lennart Carleson's much stronger result that the series actually converges almost everywhere.

There are many known tests that ensure that the series converges at a given point *x*, for example, if the function is differentiable at *x*. Even a jump discontinuity does not pose a problem: if the function has left and right derivatives at *x*, then the Fourier series will converge to the average of the left and right limits (but see Gibbs phenomenon). However, a fact that many find surprising, is that the Fourier series of a continuous function need not converge pointwise.

This unpleasant situation is counter-balanced by a theorem by Dirichlet which states that if *f* is -periodic and piecewise continuously differentiable function, then its Fourier series converges pointwise and , where and . If *f* is continuous as well as piecewise continuously differentiable, then the Fourier series converges uniformly.

In 1922, Andrey Kolmogorov published an article entitled Une série de Fourier-Lebesgue divergente presque partout in which he gave an example of a Lebesgue-integrable function whose Fourier series diverges almost everywhere. This function is not in .

### Plancherel's and Parseval's theorems[edit | edit source]

Another important property of the Fourier series is the Plancherel theorem. Let and be the corresponding complex Fourier coefficients. Then

where denotes the conjugate of *z*.

Parseval's theorem, a special case of the Plancherel theorem, states that:

which can be restated with the real Fourier coefficients:

These theorems may be proven using the orthogonality relationships. They can be interpreted physically by saying that writing a signal as a Fourier series does not change its energy.

## See also[edit | edit source]

## References[edit | edit source]

- Joseph Fourier, translated by Alexander Freeman (1822).
*The Analytical Theory of Heat*. translated 1878, re-released 2003. Dover Publications. ISBN 0-486-49531-0. 2003 unabridged republication of the 1878 English translation by Alexander Freeman of Fourier's work*Théorie Analytique de la Chaleur*, originally published in 1822. - Yitzhak Katznelson,
*An introduction to harmonic analysis*, Second corrected edition. Dover Publications, Inc., New York, 1976. ISBN 0-486-63331-4 - Felix Klein,
*Development of mathematics in the 19th century*. Mathsci Press Brookline, Mass, 1979. Translated by M. Ackerman from*Vorlesungen über die Entwicklung der Mathematik im 19 Jahrhundert*, Springer, Berlin, 1928. - Walter Rudin,
*Principles of mathematical analysis*, Third edition. McGraw-Hill, Inc., New York, 1976. ISBN 0-07-054235-X - William E. Boyce and Richard C. DiPrima,
*Elementary Differential Equations and Boundary Value Problems*, Eighth edition. John Wiley & Sons, Inc., New Jersey, 2005. ISBN 0-471-43338-1

## External links[edit | edit source]

- Phasor Phactory Allows custom control of the harmonic amplitudes for arbitrary terms
- Java applet shows Fourier series expansion of an arbitrary function
- Example problems - Examples of computing Fourier Series
- Fourier series explanation - A simple, non-mathematical approach
- Template:MathWorld
- Fourier Series Module by John H. Mathews
- Joseph Fourier - A site on Fourier's life which was used for the historical section of this article