Fourier series
decomposition of periodic functions into sums of simpler sinusoidal forms
AI overview
A Fourier series breaks down any repeating pattern or wave into a sum of simple, regularly-oscillating sine and cosine waves of different frequencies and strengths. This matters because it lets scientists and engineers analyze complex repeating phenomena—from sound waves to electrical signals—by understanding their simpler building blocks.
AI-generated from the Wikipedia summary — may contain errors.
Article
A Fourier series (/ˈfʊrieɪ, -iər/) is a series expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric 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 Fourier series § Definition.
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.