What is the point of Fourier Series if you can do the Fourier Transform?

Click For Summary

Discussion Overview

The discussion revolves around the relevance and application of Fourier Series in comparison to Fourier Transforms. Participants explore the contexts in which each is used, the relationship between them, and the educational value of learning Fourier Series.

Discussion Character

  • Debate/contested
  • Technical explanation
  • Conceptual clarification
  • Mathematical reasoning

Main Points Raised

  • Some participants question the necessity of finding Fourier coefficients when Fourier Transforms can represent the same information.
  • It is noted that Fourier Series are specifically defined for periodic functions, while Fourier Transforms apply to functions integrable over the real line, suggesting different contexts for their use.
  • One participant mentions that understanding Fourier Series can provide an intuitive grasp of Fourier Transforms and highlights historical reasons for their study.
  • Another viewpoint suggests that Fourier Series may be easier to work with in certain situations.
  • An example is provided where the density function of the normal distribution can be transformed but not expressed as a Fourier Series, illustrating limitations of Fourier Series.
  • A detailed mathematical argument is presented showing how Fourier Series can be derived from Fourier Transform theory, emphasizing their interconnectedness.
  • Practical considerations are raised, noting that numerical analysis often requires finite approximations, making Fourier Series a useful tool.
  • Participants discuss the application of Fourier Series and Transforms in solving linear eigenvalue problems, noting that different types of eigenvalues may necessitate different representations.
  • It is mentioned that in computational physics, Fourier Series and Transforms are often used interchangeably in casual contexts.

Areas of Agreement / Disagreement

Participants express differing views on the necessity and utility of Fourier Series versus Fourier Transforms. While some acknowledge the educational and practical benefits of Fourier Series, others question their relevance given the capabilities of Fourier Transforms. No consensus is reached on the superiority or exclusivity of one approach over the other.

Contextual Notes

Limitations include the dependence on the periodicity of functions for Fourier Series and the necessity of finite approximations in numerical applications. The discussion also highlights the unresolved relationship between the two methods in various contexts.

Rib5
Messages
59
Reaction score
0
Hey,

I was wondering. Since the Fourier Series coefficients can just be represented in the form of a Fourier Transform, what is the point of ever finding the Fourier coefficients and not doing the transform?
 
Mathematics news on Phys.org
For example, to reconstruct a bandlimited signal from Fourier coefficients (happen to be the samples in time domain)
 
Rib5 said:
Hey,

I was wondering. Since the Fourier Series coefficients can just be represented in the form of a Fourier Transform, what is the point of ever finding the Fourier coefficients and not doing the transform?
Fourier series are defined for periodic functions (finite interval) while Fourier transforms are defined for functions integrable over the real line. They just have different contexts.
 
mathman said:
Fourier series are defined for periodic functions (finite interval) while Fourier transforms are defined for functions integrable over the real line. They just have different contexts.


Yes, but the OP's point is that all functions that can be expanded in Fourier series can also be Fourier transformed so why bother with Fourier series at all. And I can't say I really have a reason to disagree.
 
maverick_starstrider said:
Yes, but the OP's point is that all functions that can be expanded in Fourier series can also be Fourier transformed so why bother with Fourier series at all. And I can't say I really have a reason to disagree.

I asked my teacher about it in class today, and he pretty much said the same thing. He said that the main reason we learn about Fourier series is that it helps students understand the Fourier transform more intuitively, and also for historical reasons about how the Fourier transform was developed.
 
How about, you do the Fourier series because it is easier.
 
An example: the density function for the normal distribution is Ke-x2/2. It has a Fourier transform, but you cannot expand it with a Fourier series.
 
mathman said:
An example: the density function for the normal distribution is Ke-x2/2. It has a Fourier transform, but you cannot expand it with a Fourier series.

The OP's question concerns the other way around. Any function that has a Fourier series also has a Fourier transform. How are they related? The following argument has been taken from Brad Osgood's excellent course that's available online.

Let [itex]\Phi[/itex] be a periodic function of period T. Then [itex]\Phi[/itex] can be written as
[tex]\Phi(t) = \phi(t) \ast \sum_{k = -\infty}^\infty \delta(t-kT)[/tex]
where [itex]\phi[/itex] is one period of [itex]\Phi[/itex] and [itex]\ast[/itex] denotes convolution. Now, by the convolution theorem (the Fourier tranform of a convolution is the product of the Fourier transforms),
[tex] \begin{align*}<br /> \mathcal{F}\Phi(s) &= <br /> \Bigl(\mathcal{F}\phi(s) \Bigr) \frac{1}{T}\sum_{k = -\infty}^\infty \delta\left(s-\frac{k}{T}\right) \\<br /> &= \frac{1}{T}\sum_{k = -\infty}^\infty \mathcal{F}\phi\left(\frac{k}{T}\right)\delta\left(s-\frac{k}{T}\right) <br /> \end{align*}[/tex]

Taking the inverse Fourier transform gives us back [itex]\Phi[/itex]. Since [itex]\mathcal{F}\phi\left(k/T\right)[/itex] are constants and the inverse Fourier transform of a shifted delta function is a complex exponential,
[tex] \Phi(t) = \sum_{k = -\infty}^\infty \frac{1}{T}\mathcal{F}\phi\left(\frac{k}{T}\right) e^{2\pi i k t/T}[/tex]
However,
[tex] \frac{1}{T}\mathcal{F}\phi\left(\frac{k}{T}\right) = <br /> \frac{1}{T} \int_{-\infty}^{\infty} e^{-2\pi i (k/T)t}\phi(t) \, dt \\<br /> = \frac{1}{T} \int_{0}^{T} e^{-2\pi i (k/T)t}\Phi(t) \, dt<br /> [/itex]<br /> <br /> But this is the k-th Fourier coefficient [itex]c_k[/itex] of [itex]\Phi[/itex]. In other words, the Fourier series is a consequence of Fourier transform theory.<br /> [tex] \Phi(t) = \sum_{k = -\infty}^\infty c_k e^{2\pi ikt/T}, \qquad \text{where} \qquad<br /> c_k = \frac{1}{T} \int_{0}^{T} e^{-2\pi i (k/T)t}\Phi(t) \, dt[/tex][/tex]
 
Last edited:
One reason for using Fourier series is simply practical. When analyzing something numerically you have to stop somewhere. You can't calculate it to the infinite decimal place. In calculating an integral this amounts to (1) using a finite domain, and (2) approximating the integral with a summation. With the Fourier transform integral the most convenient and obvious way to do this is to use a Fourier series. Even then, it is not a true Fourier series since you have to stop the summation after a finite number of terms.

Indeed, computational physicists use the terms "Fourier transform" and "Fourier series" interchangeably in casual conversation.
 
  • #10
A lot of times Fourier series and transforms show up in applications like solving linear eigenvalue problems. For some problems sinusoids are the eigenfunctions, and if the operator has a discrete set of eigenvalues it is natural to represent the solution to the eigenvalue problem in the form of a Fourier series - it kind of "falls out" when solving the problem and throwing an integral transform at the problem (especially without an understanding of Fourier series!) can be more cumbersome. If the operator has a continuous set of eigenvalues then it is natural to represent the solution as an integral transform. Some problems even have both kinds of eigenvalues, so the solution can be nicely written as a the combination of a sum and an integral. Usually there are clear physical interpretations for the various terms, so it is nice to keep them separate. Facility dealing with both the series and the transform allows you to use whatever is most convenient for the problem at hand, and to easily make the transition to other sets of basis functions that many applications require.

Also, as noted by pellman, Fourier series show up in numerics all the time. And in the era of digitized data, the DFT (usually implemented as an FFT whenever possible) is used all the time to look at spectral content or to quickly do convolutions. What is the DFT? It effectively assumes your data are periodic and that you only have one period sampled, so it does the periodic extension of the data (like you learn about with simple Fourier series problems!) and finds the discrete Fourier series.

So of course you are right, and it is probably good for you to lump them together in your head (along with Laplace transforms, etc.), but I would claim that making yourself work through some of the Fourier series results in a class is still a useful exercise.

jason
 

Similar threads

  • · Replies 12 ·
Replies
12
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K