Transform
81Fractional Fourier transform — In mathematics, in the area of harmonic analysis, the fractional Fourier transform (FRFT) is a linear transformation generalizing the Fourier transform. It can be thought of as the Fourier transform to the n th power where n need not be an… …
82Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group …
83Mellin transform — In mathematics, the Mellin transform is an integral transform that may be regarded as the multiplicative version of the two sided Laplace transform. This integral transform is closely connected to the theory of Dirichlet series, and is often used …
84S transform — In mathematics, the S transform is usually realized as a Laplace transform. However, S transform in the time frequency distribution was developed in 1994 for analyzing geophysics data. [Hongmei Zhu, PhD and J. Ross Mitchell, PhD, The S Transform… …
85Discrete Fourier transform (general) — See also: Fourier transform on finite groups This article is about the discrete Fourier transform (DFT) over any field (including finite fields), commonly called a number theoretic transform (NTT) in the case of finite fields. For specific… …
86Sumudu transform — In mathematics, the Sumudu transform, is an integral transform similar to the Laplace transform, introduced in the early 1990s by Gamage K. Watugala to solve differential equations and control engineering problems.Formal DefinitionThe Sumudu… …
87Discrete-time Fourier transform — In mathematics, the discrete time Fourier transform (DTFT) is one of the specific forms of Fourier analysis. As such, it transforms one function into another, which is called the frequency domain representation, or simply the DTFT , of the… …
88Binomial transform — In combinatorial mathematics the binomial transform is a sequence transformation (ie, a transform of a sequence) that computes its forward differences. It is closely related to the Euler transform, which is the result of applying the binomial… …
89Continuous wavelet transform — of frequency breakdown signal. Used symlet with 5 vanishing moments. A continuous wavelet transform (CWT) is used to divide a continuous time function into wavelets. Unlike Fourier transform, the continuous wavelet transform possesses the ability …
90Hankel transform — Besides the meaning discussed in this article, the Hankel transform may also refer to the determinant of the Hankel matrix of a sequence .In mathematics, the Hankel transform of order nu; of a function f ( r ) is given by::F u(k) = int 0^infty… …
