Search results
Jump to navigation
Jump to search
Page title matches
- ...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
- #Redirect [[Fourier transform]]31 bytes (3 words) - 21:59, 12 April 2008
- 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
- 12 bytes (1 word) - 08:18, 30 January 2008
- 127 bytes (18 words) - 23:02, 17 February 2009
- 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
- ...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
- #Redirect [[Fourier transform]]31 bytes (3 words) - 21:59, 12 April 2008
- #REDIRECT [[Fast Fourier transform]]36 bytes (4 words) - 05:30, 22 October 2013
- ...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
- ...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
- ...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 a807 bytes (129 words) - 22:12, 3 September 2010
- Auto-populated based on [[Special:WhatLinksHere/Fourier transform]]. Needs checking by a human.717 bytes (87 words) - 16:38, 11 January 2010
- ...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 the1 KB (184 words) - 13:47, 27 July 2020
- ...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
- {{r|Fourier transform}}271 bytes (29 words) - 23:56, 30 November 2010
- 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 that11 KB (1,589 words) - 08:58, 9 September 2020
- * [[Fourier transform]]896 bytes (139 words) - 00:49, 2 July 2008
- {{r|Fourier transform}}575 bytes (70 words) - 07:35, 16 April 2010
- {{r|Fourier transform}}466 bytes (59 words) - 11:54, 11 January 2010
- * Fourier transform *The [[fast fourier transform]], also known as the fft.2 KB (286 words) - 07:49, 10 February 2021
- ...with n-dimensional arrays, [[Complex numbers]], [[Linear algebra]], [[fast Fourier transform]] and plotting controls (2D and 3D), ILNumerics helps developing algorithms617 bytes (84 words) - 07:14, 22 October 2013
- {{r|Fourier transform}}548 bytes (69 words) - 16:01, 11 January 2010
- {{r|Fourier transform}}554 bytes (70 words) - 16:01, 11 January 2010
- {{r|Fourier transform}}618 bytes (75 words) - 15:40, 11 January 2010
- 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
- {{r|Fourier transform}}565 bytes (72 words) - 17:08, 11 January 2010
- {{r|Fast Fourier Transform}}604 bytes (87 words) - 17:03, 12 January 2010
- {{r|Fast Fourier transform}}888 bytes (123 words) - 17:03, 13 July 2008
- // The "miminal" Fast Fourier Transform by Dmitrii Kouznetsov1 KB (247 words) - 21:09, 8 September 2020
- ==Fourier transform==5 KB (796 words) - 13:09, 24 December 2008
- ...s C++ routine required for compilation of examples with [[DCTI]], Discrete Fourier transform of the First kind.1,002 bytes (150 words) - 21:52, 9 September 2020
- {{r|Fourier transform}}1 KB (189 words) - 17:55, 17 April 2010
- ...rom a third vector field, the [[vector potential]] '''A'''. Below, the [[Fourier transform]] of the three real fields '''E''', '''B''', and '''A''' will be introduced15 KB (2,576 words) - 00:07, 1 December 2010
- The [[Fourier transform]] translates convolution into [[pointwise operation|pointwise multiplicatio2 KB (338 words) - 17:41, 23 December 2008
- ...trogen-Containing Aromatic Compounds from a Single Electrospray Ionization Fourier Transform Ion Cyclotron Resonance Mass Spectrum of Heavy Petroleum Crude Oil; Kuangna ...biodegraded reservoir and surface crude oils by negative ion electrospray Fourier transform ion cyclotron resonance mass spectrometry;Christine A. Hugheya, Samantha A.10 KB (1,572 words) - 15:08, 16 November 2010
- ...Gaussian exponential]] exp(−''x''<sup>2</sup>/2) is a fixed point of the [[Fourier transform]] operator <math>\mathcal{F}</math> defined by ...e value at ''p'' of the Fourier transform <math>\mathcal{F}[f]</math>; the Fourier transform is the result of applying the operator <math>\mathcal{F}</math> to the func10 KB (1,562 words) - 07:20, 13 November 2013
- ...ll an associated eigenfunction expansion (similar to Fourier series versus Fourier transform). This is important in [[quantum mechanics]], since the one-dimensional [[S15 KB (2,332 words) - 04:52, 18 October 2009
- By taking the [[Fourier transform]] of this equation in the time variable, or equivalently, by looking for ti4 KB (604 words) - 23:44, 30 November 2010
- The decomposition is formulated in '''r'''-space. By a [[Fourier transform]] the decomposition may be formulated in '''k'''-space. This is advantageou11 KB (1,756 words) - 14:38, 12 April 2009
- ...and using the ordinary rules of integral calculus. The delta function as a Fourier transform of the unit function ''f''(''x'') = 1 (the second property) will be proved The Dirac delta function is the Fourier transform of the unit function ''f''(''x'') = 1.14 KB (2,220 words) - 12:28, 26 October 2021
- ...dded. Many different transforms can be used; among the commonest are the [[Fourier transform]] for sound data and [[discrete cosine transform]] for images or video. The11 KB (1,766 words) - 09:26, 31 October 2015
- ...cal calculus tools, such as [[convolution (mathematics)|convolution]] or [[Fourier transform]], can be defined for distributions and, more importantly, the theory of [[5 KB (786 words) - 21:28, 19 February 2010
- ...res]] and [[operating systems|platforms]], and is dedicated to computing [[fourier transform|Fourier Transforms]] on data received from [[radio telescope|radio telescop11 KB (1,565 words) - 15:12, 10 June 2010
- ...rm multi-chromatic wave would be apt, but is never used). By means of [[Fourier transform|Fourier analysis]] a non-monochromatic wave can be decomposed into its mono25 KB (3,994 words) - 17:54, 17 April 2010
- ===Fourier transform NMR spectroscopy=== ...is often referred to as the free induction decay, abbreviated as fid). A [[fourier transform]] of the response gives information regarding the frequency response.41 KB (6,350 words) - 04:54, 21 March 2024
- ...is often referred to as the free induction decay, abbreviated as fid). A [[fourier transform]] of the response gives information regarding the frequency response. In the case of a single pulse perturbation, the [[fourier transform]] of the time dependent response is equivalent to a 1D NMR spectrum.39 KB (6,024 words) - 04:54, 21 March 2024
- .... Multiplication of large numbers can be done efficiently using the [[fast Fourier transform]], but there is no corresponding fast algorithm for division. However, divi17 KB (2,889 words) - 12:40, 11 June 2009
- ...ng arithmetic. The discovery of the [[Karatsuba algorithm]] and the [[fast Fourier transform]] (FFT) in the 1960s facilitated multiplication and division of numbers wit15 KB (2,275 words) - 19:45, 1 September 2020
- ...o, the standard normal density function φ is an [[eigenfunction]] of the [[Fourier transform]].46 KB (6,956 words) - 07:01, 9 June 2009
- The psychoacoustic model is applied using a 1024-point [[Fast Fourier Transform]] (FFT). Of the 1152 samples per frame, 64 samples at the top and bottom o60 KB (8,883 words) - 02:16, 18 November 2009
- ...y sensitive, MM-1. A Remote Sensing Chemical Agent Alarm (M21), which is a Fourier Transform Infrared Spectrometer, a form of [[infrared spectroscopy]], that exploits t25 KB (3,570 words) - 12:10, 31 March 2024
- ...]]s, and in a numerical method that speeds calculation, such as the [[fast Fourier transform]]. [[G. H. Hardy]] in ''[[A Mathematician's Apology]]'' expressed the beli30 KB (4,289 words) - 16:03, 20 January 2023
- * [[Fourier transform]]25 KB (3,396 words) - 13:29, 2 April 2024
- ...hese are not transit time measurements, but are based upon comparison of [[Fourier transform]]s of images with theoretical results from computer modeling. Such elaborat34 KB (5,178 words) - 10:12, 28 February 2024