When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Fourier series - Wikipedia

    en.wikipedia.org/wiki/Fourier_series

    A Fourier series (/ ˈ f ʊr i eɪ,-i ər / [1]) is an expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series. [2] By expressing a function as a sum of sines and cosines, many problems involving the function become easier to analyze because trigonometric functions are ...

  3. Fourier sine and cosine series - Wikipedia

    en.wikipedia.org/wiki/Fourier_sine_and_cosine_series

    An Elementary Treatise on Fourier's Series: And Spherical, Cylindrical, and Ellipsoidal Harmonics, with Applications to Problems in Mathematical Physics (2 ed.). Ginn. p. 30. Carslaw, Horatio Scott (1921). "Chapter 7: Fourier's Series". Introduction to the Theory of Fourier's Series and Integrals, Volume 1 (2 ed.). Macmillan and Company. p. 196.

  4. Fourier analysis - Wikipedia

    en.wikipedia.org/wiki/Fourier_analysis

    A number of authors, notably Jean le Rond d'Alembert, and Carl Friedrich Gauss used trigonometric series to study the heat equation, [20] but the breakthrough development was the 1807 paper Mémoire sur la propagation de la chaleur dans les corps solides by Joseph Fourier, whose crucial insight was to model all functions by trigonometric series ...

  5. Dirichlet kernel - Wikipedia

    en.wikipedia.org/wiki/Dirichlet_kernel

    The convolution of D n (x) with any function f of period 2 π is the nth-degree Fourier series approximation to f, i.e., we have () = () = = ^ (), where ^ = is the k th Fourier coefficient of f. This implies that in order to study convergence of Fourier series it is enough to study properties of the Dirichlet kernel.

  6. Harmonic analysis - Wikipedia

    en.wikipedia.org/wiki/Harmonic_analysis

    Harmonic analysis is a branch of mathematics concerned with investigating the connections between a function and its representation in frequency.The frequency representation is found by using the Fourier transform for functions on unbounded domains such as the full real line or by Fourier series for functions on bounded domains, especially periodic functions on finite intervals.

  7. Chebyshev polynomials - Wikipedia

    en.wikipedia.org/wiki/Chebyshev_polynomials

    Chebyshev polynomials can be defined in this form when studying trigonometric polynomials. [ 4 ] That cos nx is an n th- degree polynomial in cos x can be seen by observing that cos nx is the real part of one side of de Moivre's formula : cos ⁡ n θ + i sin ⁡ n θ = ( cos ⁡ θ + i sin ⁡ θ ) n . {\displaystyle \cos n\theta +i\sin n ...

  8. Sine and cosine transforms - Wikipedia

    en.wikipedia.org/wiki/Sine_and_cosine_transforms

    By applying Euler's formula (= ⁡ + ⁡), it can be shown (for real-valued functions) that the Fourier transform's real component is the cosine transform (representing the even component of the original function) and the Fourier transform's imaginary component is the negative of the sine transform (representing the odd component of the ...

  9. Fejér kernel - Wikipedia

    en.wikipedia.org/wiki/Fejér_kernel

    In mathematics, the Fejér kernel is a summability kernel used to express the effect of Cesàro summation on Fourier series. It is a non-negative kernel, giving rise to an approximate identity . It is named after the Hungarian mathematician Lipót Fejér (1880–1959).