Search results
Create the page "Discrete Fourier Transform" on this wiki! See also the search results found.
- '''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
- // Discrete Approcimation of [[Fourier operator]] // The "miminal" Fast Fourier Transform by Dmitrii Kouznetsov1 KB (238 words) - 14:33, 20 June 2013
- ...''FFT''', is the efficient algorithm for the numerical evaluation of the [[Discrete Fouler Tansform]] defined with fafo(*complex(double), int, int) of the [[Fourier operator]].6 KB (1,010 words) - 13:23, 24 December 2020
- '''Fourier-2 transform''' is bidimensional [[Fourier transform]] The transform \(g\) of a function \(f\) is defined with expression6 KB (954 words) - 18:27, 30 July 2019
- '''Bessel Transform''' or BesselTransform, called also '''Hankel transform''' ==Hankel transform and Bessel transform==8 KB (1,183 words) - 10:21, 20 July 2020
- '''Discrete Hankel transform''' is the numerical analogy of the [[Bessel transform]]. http://www.gnu.org/software/gsl/manual/html_node/Discrete-Hankel-Transform-Definition.html</ref> is copypasted with minimal torification.7 KB (1,063 words) - 18:25, 30 July 2019
- ===Self–Fourier functions=== ...FTt200.png|400px|thumb|Two self-Fourier functions (dotted lines) and their discrete representations (segmented lines). Click the image to get its generator]]6 KB (915 words) - 18:26, 30 July 2019
- 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 matr6 KB (1,032 words) - 18:48, 30 July 2019
- ...length in a way, that have some analogies with the integral [[CosFourier]] transform ...w is it related with other kinds of DiscreteCos. In order to make from the Discrete Cos the useful Tool of Research and Investigation, the formulas, their desc3 KB (482 words) - 18:26, 30 July 2019
- DCTIV is one of realizations of the [[Discrete CosTransform]]. The name is borrowed from Wikipedia ==Approximation of the CosFourier transform==3 KB (421 words) - 18:26, 30 July 2019
- [[DCTI]] is one of realizations of the [[Discrete Cos transform]] operator. Numerical Recipes in C. Fast Sine and Cosine transform.10 KB (1,447 words) - 18:27, 30 July 2019
- [[DCT]] may refer to the '''Discrete cosine transform'''. The four kinds of DCT are often in use; Gilbert Strang. The Discrete Cosine Transform. SIAM REVIEW (Copyright 1999 by Society for Industrial and Applied Mathemat10 KB (1,689 words) - 18:26, 30 July 2019
- ...utine required for compilation of examples with [[DCTI]], Discrete Fourier transform of the First kind.1 KB (152 words) - 15:00, 20 June 2013
- ...utine required for compilation of examples with [[DCT1]], Discrete Fourier transform of the First kind.1 KB (234 words) - 15:00, 20 June 2013
- ...[[DCT]] transform operator (Discrete Cosine transform); it is one of many discrete analogies of the integral operator [[CosFourier]]. As in the case of other discrete Fourier transforms, the numeration of elements begins with zero.5 KB (682 words) - 18:27, 30 July 2019
- ...[[DCT]] transform operator (Discrete Cosine transform); it is one of many discrete analogies of the integral operator [[CosFourier]]. As in the case of other discrete Fourier transforms, the numeration of elements begins with zero.6 KB (825 words) - 18:25, 30 July 2019
- [[CFT]], is the discrete implementation of the [[CosFT]] transform. ...e of CFT routine, that reproduces, up to the rounding errors, the identity transform of the array in the First column, \(~\)CFT(CFT(\(f\)))\(\,\approx f~\).5 KB (721 words) - 18:44, 30 July 2019
- [[Discrete Bessel]] is one of the discrete approximations of the [[Bessel transform]]. ==[[Bessel transform]]==8 KB (1,153 words) - 18:44, 30 July 2019
- ...sinft.cin]] is complex double routine for evaluation of the [[discrete sin transform]] ([[dsft]]) [[Fourier]],1 KB (161 words) - 07:07, 1 December 2018