Fourier series | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

A Fourier series (ˈfʊrieɪ,_-iər) is an expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series, but not all trigonometric series are Fourier series. By expressing a function as a sum of sines and cosines, many problems involving the function become easier to analyze because trigonometric functions are well understood. For example, Fourier series were first used by Joseph Fourier to find solutions to the heat equation. This application is possible because the derivatives of trigonometric functions fall into simple patterns. Fourier series cannot be used to approximate arbitrary functions, because most functions have infinitely many terms in their Fourier series, and the series do not always converge. Well-behaved functions, for example smooth functions, have Fourier series that converge to the original function. The coefficients of the Fourier series are determined by integrals of the function multiplied by trigonometric functions, described in Common forms of the Fourier series below. The study of the convergence of Fourier series focus on the behaviors of the partial sums, which means studying the behavior of the sum as more and more terms from the series are summed. The figures below illustrate some partial Fourier series results for the components of a square wave. File:SquareWaveFourierArrows,rotated,nocaption 20fps.gif|A square wave (represented as the blue dot) is approximated by its sixth partial sum (represented as the purple dot), formed by summing the first six terms (represented as arrows) of the square wave's Fourier series. Each arrow starts at the vertical sum of all the arrows to its left (i.e. the previous partial sum). File:Fourier Series.svg|The first four partial sums of the Fourier series for a [[square wave]]. As more harmonics are added, the partial sums ''converge to'' (become more and more like) the square wave. File:Fourier series and transform.gif|Function s_6(x) (in red) is a Fourier series sum of 6 harmonically related sine waves (in blue).

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (23)

Related people (12)

Related concepts (168)

Related courses (100)

Related lectures (518)

Related MOOCs (17)

Fourier series

Convolution theorem

In mathematics, the convolution theorem states that under suitable conditions the Fourier transform of a convolution of two functions (or signals) is the pointwise product of their Fourier transforms. More generally, convolution in one domain (e.g., time domain) equals point-wise multiplication in the other domain (e.g., frequency domain). Other versions of the convolution theorem are applicable to various Fourier-related transforms. Consider two functions and with Fourier transforms and : where denotes the Fourier transform operator.

Sawtooth wave

The sawtooth wave (or saw wave) is a kind of non-sinusoidal waveform. It is so named based on its resemblance to the teeth of a plain-toothed saw with a zero rake angle. A single sawtooth, or an intermittently triggered sawtooth, is called a ramp waveform. The convention is that a sawtooth wave ramps upward and then sharply drops. In a reverse (or inverse) sawtooth wave, the wave ramps downward and then sharply rises. It can also be considered the extreme case of an asymmetric triangle wave.

Digital Signal Processing I

Basic signal processing concepts, Fourier analysis and filters. This module can be used as a starting point or a basic refresher in elementary DSP

Digital Signal Processing II

Adaptive signal processing, A/D and D/A. This module provides the basic tools for adaptive filtering and a solid mathematical framework for sampling and quantization

Digital Signal Processing III

Advanced topics: this module covers real-time audio processing (with examples on a hardware board), image processing and communication system design.

MATH-207(a): Analysis IV (for SV, MT)

The course studies the fundamental concepts of complex analysis with a view to their use in solving multidisciplinary problems of scientific engineering.

ENV-614: Fourier analysis and boundary value problems

Learning Fourier Series and Boundary Value Problems with a view to a variety of science and engineering problems. Learn the use of special functions like Bessel functions and applications. Introduce t

MATH-511: Modular forms and applications

In this course we will introduce core concepts of the theory of modular forms and consider several applications of this theory to combinatorics, harmonic analysis, and geometric optimization.

Scaling & Renormalization in Statistical Mechanics

Explores scaling and renormalization in statistical mechanics, emphasizing critical points and invariant properties.

Fourier Series: Theory and Comparison

Delves into Fourier series theory, computation, and comparison with functions using the Dirichlet theorem.

Fourier Series and Laplace Transform

Covers Fourier series calculations and Laplace transform applications for periodic functions efficiently using tables and properties.

Perturbed Fourier uniqueness and interpolation results in higher dimensions

Martin Peter Stoller

We obtain new Fourier interpolation and uniqueness results in all dimensions, extending methods and results by the first author and M. Sousa [11] and the second author [12]. We show that the only Schw

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

We prove that every Schwartz function in Euclidean space can be completely recovered given only its restrictions and the restrictions of its Fourier transform to all origin-centered spheres whose radi

EPFL2022

Fourier non-uniqueness sets from totally real number fields

Martin Peter Stoller

Let K be a totally real number field of degree n >= 2. The inverse different of K gives rise to a lattice in Rn. We prove that the space of Schwartz Fourier eigenfunctions on R-n which vanish on the "

EUROPEAN MATHEMATICAL SOC-EMS2022