fft+analysis

См. также в других словарях:

• FFT — Fast Fourier Transform (Academic & Science » Mathematics) Fast Fourier Transform (Academic & Science » Electronics) Fast Fourier Transform (Academic & Science » Physics) * Training Frigate (Governmental » Military) * Fast Fourier Transform… …   Abbreviations dictionary

• List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

• Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… …   Wikipedia

• Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… …   Wikipedia

• List of harmonic analysis topics — This is a list of harmonic analysis topics, by Wikipedia page. See also list of Fourier analysis topics and list of Fourier related transforms, which are more directed towards the classical Fourier series and Fourier transform of mathematical… …   Wikipedia

• Fourier analysis — In mathematics, Fourier analysis is a subject area which grew out of the study of Fourier series. The subject began with trying to understand when it was possible to represent general functions by sums of simpler trigonometric functions. The… …   Wikipedia

• Bruun's FFT algorithm — Bruun s algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996 …   Wikipedia

• Fourier-Analysis — Die Fourier Analysis (Aussprache des Namens: fur je) auch bekannt als Fourier Analyse oder klassische harmonische Analyse ist die Theorie der Fourier Reihen und Fourier Integrale. Ihre Ursprünge reichen in das 18. Jahrhundert zurück. Benannt sind …   Deutsch Wikipedia

• Spectrum continuation analysis — (SCA) is a generalization of the concept of Fourier series to non periodic functions of which only a fragment has been sampled in the time domain.Recall that a Fourier series is only suitable to the analysis of periodic (or finite domain)… …   Wikipedia

• Prime-factor FFT algorithm — The Prime factor algorithm (PFA), also called the Good Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re expresses the discrete Fourier transform (DFT) of a size N = N 1 N 2 as a two dimensional N 1 times; N 2 DFT …   Wikipedia

• Dynamic mechanical analysis — Viscoanalyseur Pour les articles homonymes, voir AMD et DMA. Un viscoanalyseur ou analyseur mécanique dynamique (AMD) fait partie de la famille des appareils de DMA ou DMTA (en anglais Dynamic Mechanical Thermal Analysis). Cet instrument… …   Wikipédia en Français