Related papers: Calculation of local formal Fourier transforms
We established a new method called Discrete Weierstrass Fourier Transform, a faster and more generalized Discrete Fourier Transform, to approximate discrete data. The theory of this method as well as some experiments are analyzed in this…
The Fourier transforms of polyhedral cones can be used, via Brion's theorem, to compute various geometric quantities of polytopes, such as volumes, moments, and lattice-point counts. We present a novel method of computing these conic…
Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…
A number of elegant approaches have been developed for the identification of quantum circuits which can be efficiently simulated on a classical computer. Recently, these methods have been employed to demonstrate the classical simulability…
This note establishes the connection between Friedrich's conformal field equations and the conformally invariant formalism of local twistors.
The thesis deals with applications of fractional calculus to fractals. It introduces the notion of local fractional derivative (LFD). Fractal and multifractal functions have been studied in the thesis using LFD. New kind of equations are…
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
This paper describes a method of calculating the transforms, currently obtained via Fourier and reverse Fourier transforms. The method allows calculating efficiently the transforms of a signal having an arbitrary dimension of the digital…
We compute support of formal cohomology modules in a serial of non-trivial cases. Applications are given. For example, we compute injective dimension of certain local cohomology modules in terms of dimension of their's support.
Laumon introduced the local Fourier transform for $\ell$-adic Galois representations of local fields, of equal characteristic $p$ different from $\ell$, as a powerful tool to study the Fourier-Deligne transform of $\ell$-adic sheaves over…
We relate Fourier transforms between compactified Jacobians over the moduli space of stable curves to logarithmic Abel-Jacobi theory. As an application, we compute the pushforward of divisor monomials on compactified Jacobians in terms of…
Let f be a newform of weight two, prime level p. If D is a fundamental discriminant, define the twisted L-function L(f,D,s) to be the L-function associated to the twist of f by the quadratic character of conductor D. In this paper we…
We construct a version of Fourier transform for a class of non-commutative algebras over abelian varieties which include algebras of twisted differential operators generalizing the previous construction of Laumon (alg-geom/9603004) and of…
This paper gives a short survey of some basic results related to estimates of fractional integrals and Fourier transforms. It is closely adjoint to our previous survey papers \cite{K1998} and \cite{K2007}. The main methods used in the paper…
In the present paper, the wavelet transform of Fractal Interpolation Function (FIF) is studied. The wavelet transform of FIF is obtained through two different methods. The first method uses the functional equation through which FIF is…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
This paper determines how to define a discretely implemented Fourier transform when analysing an observed spatial point process. To develop this transform we answer four questions; first what is the natural definition of a Fourier…
Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a…
We discuss various forms of the Plancherel Formula and the Plancherel Theorem on reductive groups over local fields.
We consider the relations between well-known Fourier transform algorithms.