Search results

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

Page title matches

• Fourier transform
  '''Fourier transform''' is linear integral transform with the exponential [[kernel]]. If the integral converges, then, function \(B\) is called '''Fourier transform''' of function \(A\).
  11 KB (1,501 words) - 18:44, 30 July 2019
• Fourier operator
  47 bytes (5 words) - 14:33, 20 June 2013
• Fourier-2 transform
  '''Fourier-2 transform''' is bidimensional [[Fourier transform]] The Fourier transform can be used for the filtering of the function. An example of such
  6 KB (954 words) - 18:27, 30 July 2019
• Discrete Fourier
  For natural number \(N>1\), the '''Discrete Fourier''' is operator \(\hat ふ_N\) While deal with Fourier operators, it is convenient to begin numeration with zero. Elements of matr
  6 KB (1,032 words) - 18:48, 30 July 2019

Page text matches

• Fourier transform
  '''Fourier transform''' is linear integral transform with the exponential [[kernel]]. If the integral converges, then, function \(B\) is called '''Fourier transform''' of function \(A\).
  11 KB (1,501 words) - 18:44, 30 July 2019
• Fafo.cin
  // Discrete Approcimation of [[Fourier operator]] // The "miminal" Fast Fourier Transform by Dmitrii Kouznetsov
  1 KB (238 words) - 14:33, 20 June 2013
• FFT
  The '''Fast Fourier Transform''' or '''FFT''', is the efficient algorithm for the numerical eva fafo(*complex(double), int, int) of the [[Fourier operator]].
  6 KB (1,010 words) - 13:23, 24 December 2020
• Fourier-2 transform
  '''Fourier-2 transform''' is bidimensional [[Fourier transform]] The Fourier transform can be used for the filtering of the function. An example of such
  6 KB (954 words) - 18:27, 30 July 2019
• Paraxial approximation
  ==Method of Fourier== The efficient method of solution of equation (3) is related to the [[Fourier transform]]. Let
  3 KB (496 words) - 18:25, 30 July 2019
• Bessel transform
  As in the case of the [[Fourier transform]], the scale of the arguments of the functions \(f\) and \(g\) ca [[BesselJ0]], [[Fourier transform]]
  8 KB (1,183 words) - 10:21, 20 July 2020
• Discrete Hankel transform
  ...a Bessel function of fixed order; compare this to the case of the discrete Fourier transform, where samples are taken at points related to the zeroes of the s
  7 KB (1,063 words) - 18:25, 30 July 2019
• CosFourier
  ===Self–Fourier functions=== [[File:SelfCosFTt200.png|400px|thumb|Two self-Fourier functions (dotted lines) and their discrete representations (segmented line
  6 KB (915 words) - 18:26, 30 July 2019
• Discrete Fourier
  For natural number \(N>1\), the '''Discrete Fourier''' is operator \(\hat ふ_N\) While deal with Fourier operators, it is convenient to begin numeration with zero. Elements of matr
  6 KB (1,032 words) - 18:48, 30 July 2019
• DiscreteCos
  [[Fourier operator]] [[Category:Fourier transform]]
  3 KB (482 words) - 18:26, 30 July 2019
• Cosft.cin
  [[Fourier operator]] [[Category:Fourier]]
  4 KB (571 words) - 15:00, 20 June 2013
• DCTIV
  ==Approximation of the Fourier coefficients==
  3 KB (421 words) - 18:26, 30 July 2019
• DCTI
  The C++ numerical CosFourier transform of the self-Fourier function \(F(x)=\exp(-x^2/2)\) can be realized as follows: The example shows, that, for the simplest [[self-Fourier]] function, 17-nodes approximation gives of order of 12 correct decimal dig
  10 KB (1,447 words) - 18:27, 30 July 2019
• DCT
  [[Category:Fourier]]
  10 KB (1,689 words) - 18:26, 30 July 2019
• Zcosft1.cin
  ...s C++ routine required for compilation of examples with [[DCTI]], Discrete Fourier transform of the First kind.
  1 KB (152 words) - 15:00, 20 June 2013
• Zrealft.cin
  ...s C++ routine required for compilation of examples with [[DCT1]], Discrete Fourier transform of the First kind.
  1 KB (234 words) - 15:00, 20 June 2013
• DCTII
  As in the case of other discrete Fourier transforms, the numeration of elements begins with zero. [[Fourier]],
  5 KB (682 words) - 18:27, 30 July 2019
• DCTIII
  As in the case of other discrete Fourier transforms, the numeration of elements begins with zero. The inverse operation, id est, calculation of the Fourier coefficients for the symmetric field known at porints \(x_m\), \(m=0..N-1\)
  6 KB (825 words) - 18:25, 30 July 2019
• Causality
  ...the [[Kramers-Kronig relation]] between real and imaginary parts of the [[Fourier]]-representation of any kind of succeptibility or permeabilty or polarizati
  7 KB (1,021 words) - 18:27, 30 July 2019
• Nori
  ...with the truncated series above can be useful for the evaluation of the [[Fourier integral]]s with function nori.
  13 KB (1,759 words) - 18:45, 30 July 2019

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