Related papers: Multi-dimensional properties of One-dimensional di…
Though calculations based on density functional theory (DFT) are used remarkably widely in chemistry, physics, materials science, and biomolecular research and though the modern form of DFT has been studied for almost 60 years, some…
The Discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm. One remarkable feature of FFT is the fact that its runtime…
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…
We find a formula that relates the Fourier transform of a radial function on $\mathbf{R}^n$ with the Fourier transform of the same function defined on $\mathbf{R}^{n+2}$. This formula enables one to explicitly calculate the Fourier…
We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Lo\`eve transform, and several others along with their continuous counterparts (Fourier transform, Fourier series,…
We report experimental implementation of discrete Fourier transformation(DFT) on a nuclear magnetic resonance(NMR) quantum computer. Experimental results agree with theoretical results. Using the pulse sequences we introduced, DFT can be…
In this paper, we propose the Fourier frequency vector (FFV), inherently, associated with multidimensional Fourier transform. With the help of FFV, we are able to provide physical meaning of so called negative frequencies in…
The most fundamental characteristics of a physical system can often be deduced from its behaviour under discrete symmetry transformations such as time reversal, parity and chirality. Here we review basic symmetry properties of the…
The discrete Fourier transform (DFT) is an important operator which acts on the Hilbert space of complex valued functions on the ring Z/NZ. In the case where N=p is an odd prime number, we exhibit a canonical basis of eigenvectors for the…
Transformations in the field of computer graphics and geometry are one of the most important concepts for efficient manipulation and control of objects in 2-dimensional and 3-dimensional space. Transformations take many forms each with…
The algorithm behind the Fast Fourier Transform has a simple yet beautiful geometric interpretation that is often lost in translation in a classroom. This article provides a visual perspective which aims to capture the essence of it.
Differential Dynamic Microscopy (DDM) analyzes traditional real-space microscope images to extract information on sample dynamics in a way akin to light scattering, by decomposing each image in a sequence into Fourier modes, and evaluating…
Dynamical density functional theory (DDFT) is a powerful variational framework to study the nonequilibrium properties of colloids by only considering a time-dependent one-body number density. Despite the large number of recent successes,…
Spectral analysis in conjunction with discrete data in one and more dimensions can become a challenging task, because the methods are sometimes difficult to understand. This paper intends to provide an overview about the usage of the…
This paper is devoted to a discussion of the Discrete Fourier Transform (DFT) representation of a chaotic finite-duration sequence. This representation has the advantage that is itself a finite-duration sequence corresponding to samples…
Density functional theory (DFT), one of the most widely utilized methods available to computational chemistry, fails to describe systems with statically correlated electrons. To address this shortcoming, in previous work we transformed DFT…
Image computation is a fundamental tool for performance assessment of astronomical instrumentation, usually implemented by Fourier transform techniques. We review the numerical implementation, evaluating a direct implementation of the…
Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse…
The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…
Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic…