Search results

Page title matches

• Fourier transform
  ...back from the frequency domain to the time domain is called the [[inverse Fourier transform]]. ...orous definition and theory the Fourier transform that is known today. The Fourier transform of a function <math>\scriptstyle f </math>, often denoted with a capital ''
  3 KB (547 words) - 07:21, 24 December 2008
• Fourier Transform
  #Redirect [[Fourier transform]]
  31 bytes (3 words) - 21:59, 12 April 2008
• Fourier transform/Approval
  12 bytes (1 word) - 08:18, 30 January 2008
• Fourier transform/Definition
  127 bytes (18 words) - 23:02, 17 February 2009
• Fast Fourier transform
  The '''fast Fourier transform''' or '''FFT''', is the efficient algorithm for the numerical evaluation of ...several efficient algorithms to perform the FFT.<ref>{{cite web|title=Fast Fourier Transform (FFT)|url=http://www.mathworks.com/help/matlab/math/fast-fourier-transform-
  9 KB (1,368 words) - 11:59, 8 September 2020
• Fourier transform/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Fourier transform]]. Needs checking by a human.
  717 bytes (87 words) - 16:38, 11 January 2010

Page text matches

• Joseph Fourier/Definition
  ...d physicist credited with describing the Fourier series based on which the Fourier transform has been formed.
  174 bytes (24 words) - 00:30, 2 July 2008
• Fourier Transform
  #Redirect [[Fourier transform]]
  31 bytes (3 words) - 21:59, 12 April 2008
• FFT
  #REDIRECT [[Fast Fourier transform]]
  36 bytes (4 words) - 05:30, 22 October 2013
• Fourier transform
  ...back from the frequency domain to the time domain is called the [[inverse Fourier transform]]. ...orous definition and theory the Fourier transform that is known today. The Fourier transform of a function <math>\scriptstyle f </math>, often denoted with a capital ''
  3 KB (547 words) - 07:21, 24 December 2008
• Classical control
  ...and transform methods, especially the [[Laplace transform|Laplace]] and [[Fourier transform|Fourier transforms]], as well as graphical techniques.
  862 bytes (114 words) - 05:54, 26 September 2007
• Heat equation
  ...n infinite spatial domain, the heat equation is usually solved using the [[Fourier transform]]. On a finite spatial domain, [[separation of variables]] is often used a
  807 bytes (129 words) - 22:12, 3 September 2010
• Fourier transform/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Fourier transform]]. Needs checking by a human.
  717 bytes (87 words) - 16:38, 11 January 2010
• Joseph Fourier
  ...He is credited with describing the [[Fourier series]] based on which the [[Fourier transform]] has been formed. He is also generally credited with the discovery of the
  1 KB (184 words) - 13:47, 27 July 2020
• CosFourier
  ...mplemented directly through the numerical implementation of the [[Discrete Fourier transform]], extending the function to the negative values of the argument.
  2 KB (288 words) - 17:57, 8 September 2020
• Inhomogeneous Helmholtz equation/Related Articles
  {{r|Fourier transform}}
  271 bytes (29 words) - 23:56, 30 November 2010
• Fourier operator
  If the integral converges, then, function <math>B</math> is called '''Fourier transform''' of function <math>A</math>. Slightly different notations are used in the article [[Fourier transform]]; operator <math>\mathcal F</math> is defined such that
  11 KB (1,589 words) - 08:58, 9 September 2020
• Joseph Fourier/Related Articles
  * [[Fourier transform]]
  896 bytes (139 words) - 00:49, 2 July 2008
• Normal distribution/Related Articles
  {{r|Fourier transform}}
  575 bytes (70 words) - 07:35, 16 April 2010
• Classical control/Related Articles
  {{r|Fourier transform}}
  466 bytes (59 words) - 11:54, 11 January 2010
• Algorithm
  * Fourier transform *The [[fast fourier transform]], also known as the fft.
  2 KB (286 words) - 07:49, 10 February 2021
• ILNumerics.Net
  ...with n-dimensional arrays, [[Complex numbers]], [[Linear algebra]], [[fast Fourier transform]] and plotting controls (2D and 3D), ILNumerics helps developing algorithms
  617 bytes (84 words) - 07:14, 22 October 2013
• Distributed computing/Related Articles
  {{r|Fourier transform}}
  548 bytes (69 words) - 16:01, 11 January 2010
• Distribution (mathematics)/Related Articles
  {{r|Fourier transform}}
  554 bytes (70 words) - 16:01, 11 January 2010
• Convolution (mathematics)/Related Articles
  {{r|Fourier transform}}
  618 bytes (75 words) - 15:40, 11 January 2010
• Fast Fourier transform
  The '''fast Fourier transform''' or '''FFT''', is the efficient algorithm for the numerical evaluation of ...several efficient algorithms to perform the FFT.<ref>{{cite web|title=Fast Fourier Transform (FFT)|url=http://www.mathworks.com/help/matlab/math/fast-fourier-transform-
  9 KB (1,368 words) - 11:59, 8 September 2020