Search results

Create the page "Fourier" on this wiki! See also the search results found.

• Four1.cin
  //The routine below is float implementation of the sin fourier transform ([[FSFT]]. It is supposed to be compiled together with [[four1.ci [[Category:Fourier]]
  2 KB (228 words) - 07:00, 1 December 2018
• Advection in log coordinate
  Change of variable \(r \mapsto x=\ln(t)\) has sense in order to apply the Fourier methods for the advection with distribution similar to the lognormal distri
  5 KB (865 words) - 18:44, 30 July 2019
• CFT
  [[Category:Discrete Fourier]]
  5 KB (721 words) - 18:44, 30 July 2019
• Discrete Bessel
  ...ourier]], and in the similar way can be used for testing of the [[discrete Fourier]] transform. The [[C++]] implementation becomes straightforward, as the example with self-Fourier from the previous section is considered; the [[C++]] implementation is used
  8 KB (1,153 words) - 18:44, 30 July 2019
• Inverse function
  ...antum mechanics and integral transform of a functions (see, for example, [[Fourier transform]]).
  3 KB (444 words) - 18:43, 30 July 2019
• Maga
  ==Fourier== Integral in the definition of function[[Maga]] can be expressed through the Fourier transforms of function [[nori]] defined with
  8 KB (1,256 words) - 18:44, 30 July 2019
• Nyquist theorem
  ...s based on the inigueness of the Fourier representaion. It refers to the [[Fourier transform]]s of functions \(f\) and \(u\): Now I substitute representation of \(f\) through its Fourier transform \(F\), this gives
  6 KB (944 words) - 18:48, 30 July 2019
• Realft.cin
  [[Fourier transform]], [[Category:Fourier transform]]
  2 KB (257 words) - 07:04, 1 December 2018
• Sinft.cin
  [[Category:Fourier]]
  874 bytes (116 words) - 07:05, 1 December 2018
• Zsinft.cin
  [[Fourier]], [[Category:Fourier]]
  1 KB (161 words) - 07:07, 1 December 2018
• Екайкин Алексей Анатольевич
  ...a method requires much less memory, than the independent generation of the Fourier-components.
  10 KB (278 words) - 22:18, 9 October 2019
• Place of science
  ...regular profiles. The coefficients in the series are calculated using fast Fourier transform algorithms resulting in a very fast method. The applicability of
  101 KB (14,271 words) - 20:58, 25 September 2020
• Richard Van Evera Lovelace
  ...loped a special [https://en.wikipedia.org/wiki/Fast_Fourier_transform fast-Fourier transform] program.<ref name="Lovelace1969">[https://ui.adsabs.harvard.edu/ ...was integer based using half-words of 12 bits and was able to do the fast Fourier transform of N=16,384 signal samples. The 8192 signal power values were pri
  15 KB (2,159 words) - 02:38, 7 October 2021

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)