Skip to content Skip to navigation

Connexions

You are here: Home » Content » Convergence of Fourier Series

Navigation

Recently Viewed

This feature requires Javascript to be enabled.

Tags

(What is a tag?)

These tags come from the endorsement, affiliation, and other lenses that include this content.

Convergence of Fourier Series

Module by: Michael Haag, Justin Romberg. E-mail the authors

User rating (How does the rating system work?)
Ratings

Ratings allow you to judge the quality of modules. If other users have ranked the module then its average rating is displayed below. Ratings are calculated on a scale from one star (Poor) to five stars (Excellent).

How to rate a module

Hover over the star that corresponds to the rating you wish to assign. Click on the star to add your rating. Your rating should be based on the quality of the content. You must have an account and be logged in to rate content.

:
(0 ratings)

Summary: This module discusses the covergence of the Fourier Series to show that it can be a very good approximation for all signals.

Note: Your browser may not currently support MathML. See our browser support page for additional details. You can always view the correct math in the PDF version.

Note: You are viewing an old version of this document. The latest version is available here.

Introduction

Before looking at this module, hopefully you have become fully convinced of the fact that any periodic function, ft f t , can be represented as a sum of complex sinusoids. If you are not, then try looking back at eigen-stuff in a nutshell or eigenfunctions of LTI systems. We have shown that we can represent a signal as the sum of exponentials through the Fourier Series equations below:

ft=n c n ω 0 nt f t n c n ω 0 n t (1)
c n =1T0Tft- ω 0 ntdt c n 1 T t T 0 f t ω 0 n t (2)
Joseph Fourier insisted that these equations were true, but could not prove it. Lagrange publicly ridiculed Fourier, and said that only continuous functions can be represented by Equation 1 (indeed he proved that Equation 1 holds for continuous-time functions). However, we know now that the real truth lies in between Fourier and Lagrange's positions.

Understanding the Truth

Formulating our question mathematically, let f N t=n=-NN c n ω 0 nt f N t n N N c n ω 0 n t where c n c n equals the Fourier coefficients of ft f t (see Equation 2).

f N t f N t is a "partial reconstruction" of ft f t using the first 2N+1 2 N 1 Fourier coefficients. f N t f N t approximates ft f t , with the approximation getting better and better as NN gets large. Therefore, we can think of the set N,N= 01 : f N t N N 0 1 f N t as a sequence of functions, each one approximating ft f t better than the one before.

The question is, does this sequence converge to ft f t ? Does f N tft f N t f t as N N ? We will try to answer this question by thinking about convergence in two different ways:

  1. Looking at the energy of the error signal: e N t=ft f N t e N t f t f N t
  2. Looking at limN f N t N f N t at each point and comparing to ft f t .

Approach #1

Let e N t e N t be the difference (i.e. error) between the signal ft f t and its partial reconstruction f N t f N t

e N t=ft f N t e N t f t f N t (3)
If ft L 2 0T f t L 2 0 T (finite energy), then the energy of e N t0 e N t 0 as N N is
0T| e N t|2dt=0Tft f N t2dt0 t T 0 e N t 2 t T 0 f t f N t 2 0 (4)
We can prove this equation using Parseval's relation: limN0T|ft f N t|2dt=limNN=-| n ft n f N t |2=limN|n|>N| c n |2=0 N t T 0 f t f N t 2 N N n f t n f N t 2 N n n N c n 2 0 where the last equation before zero is the tail sum of the Fourier Series, which approaches zero because ft L 2 0T f t L 2 0 T . Since physical systems respond to energy, the Fourier Series provides an adequate representation for all ft L 2 0T f t L 2 0 T equaling finite energy over one period.

Approach #2

The fact that e N 0 e N 0 says nothing about ft f t and limN f N t N f N t being equal at a given point. Take the two functions graphed below for example:

Figure 1
(a) (b)
Figure 1(a) (cverg1.png)Figure 1(b) (cverg2.png)

Given these two functions, ft f t and gt g t , then we can see that for all t t, ftgt f t g t , but 0T|ftgt|2dt=0 t T 0 f t g t 2 0 From this we can see the following relationships: energy convergencepointwise convergence energy convergence pointwise convergence pointwise convergence convergence in L 2 0T pointwise convergence convergence in L 2 0 T However, the reverse of the above statement does not hold true.

It turns out that if ft f t has a discontinuity (as can be seen in figure of gt g t above) at t 0 t 0 , then f t 0 limN f N t 0 f t 0 N f N t 0 But as long as ft f t meets some other fairly mild conditions, then f t =limN f N t f t N f N t if ft f t is continuous at t= t t t .

Content actions

Give Feedback:

E-mail the module authors | Rate module ( How does the rating system work?)

Rating system

Ratings

Ratings allow you to judge the quality of modules. If other users have ranked the module then its average rating is displayed below. Ratings are calculated on a scale from one star (Poor) to five stars (Excellent).

How to rate a module

Hover over the star that corresponds to the rating you wish to assign. Click on the star to add your rating. Your rating should be based on the quality of the content. You must have an account and be logged in to rate content.

(0 ratings)

Download:

Add module to:

My Favorites (?)

'My Favorites' is a special kind of lens which you can use to bookmark modules and collections directly in Connexions. 'My Favorites' can only be seen by you, and collections saved in 'My Favorites' can remember the last module you were on. You need a Connexions account to use 'My Favorites'.

| A lens (?)

Definition of a lens

Lenses

A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

What is in a lens?

Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

Who can create a lens?

Any individual Connexions member, a community, or a respected organization.

What are tags? tag icon

Tags are descriptors added by lens makers to help label content, attaching a vocabulary that is meaningful in the context of the lens.

| External bookmarks