Related papers: Fourier transformation and response functions
It has been shown that the Schwinger-Dyson equations for non-Hermitian theories implicitly include the Hilbert-space metric. Approximate Green functions for such theories may thus be obtained, without having to evaluate the metric…
In this paper, we present an assortment of both standard and advanced Fourier techniques that are useful in the analysis of astrophysical time series of very long duration -- where the observation time is much greater than the time…
We first review the convolution fast-Fourier-transform (CFFT) approach for the numerical solution of backward stochastic differential equations (BSDEs) introduced in (Hyndman and Oyono Ngou, 2017). We then propose a method for improving the…
We present an improved action for renormalizable effective field theories (EFTs) of systems near the two-body unitarity limit. The ordering of EFT interactions is constrained, but not entirely fixed, by the renormalization group. The…
We demonstrate that a quantum field theory (QFT) in general two-dimensional curved spacetimes can be realized by a system of quantum spins or qubits. We consider a spin-1/2 model on a one-dimensional ring with spatially and temporally…
We derive and showcase a novel approach to approximating Fourier transforms in higher dimensions, focusing specifically on the case of 2D radially concentrated ('ring-like') functions. We first reduce the problem to that of evaluating the…
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…
A new method of quantum state tomography for quantum information processing is described. The method based on two-dimensional Fourier transform technique involves detection of all the off-diagonal elements of the density matrix in a…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
The graph fractional Fourier transform (GFRFT) for unitary graph Fourier transform (GFT) matrices can be interpreted through the scalar function $e^{j\alpha\theta}$ on the unit circle. Under the principal branch, its Fourier-series…
A general method of the Foldy-Wouthyusen (FW) transformation for relativistic particles of arbitrary spin in strong external fields has been developed. The use of the found transformation operator is not restricted by any definite…
In this paper a sublinear time algorithm is presented for the reconstruction of functions that can be represented by just few out of a potentially large candidate set of Fourier basis functions in high spatial dimensions, a so-called…
In this paper, we mainly establish the uncertainty principle (UP) for a function and its quaternion Fractional Fourier transform (QFrFT), as well as the UP for two QFrFTs. Using the polar representation of quaternion-valued signals, we give…
A variety of problems in acoustic and electromagnetic scattering require the evaluation of impedance or layered media Green's functions. Given a point source located in an unbounded half-space or an infinitely extended layer, Sommerfeld and…
Flexible boundary condition methods couple an isolated defect to a harmonically responding medium through the bulk lattice Green's function; in the case of an interface, interfacial lattice Green's functions. We present a method to compute…
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…
Fourier transformations of pseudo-Boolean functions are popular tools for analyzing functions of binary sequences. Real-world functions often have structures that manifest in a sparse Fourier transform, and previous works have shown that…
We investigate the possibility to assist the numerically ill-posed calculation of spectral properties of interacting quantum systems in thermal equilibrium by extending the imaginary-time simulation to a finite Schwinger-Keldysh contour.…
A Fourier transform method is introduced for a class of hybrid time-frequency methods that solve the acoustic scattering problem in regimes where the solution exhibits both highly oscillatory behavior and slow decay in time. This extends…
Pseudo-spectral method is one of the most accurate techniques for simulating turbulent flows. Fast Fourier transform (FFT) is an integral part of this method. In this paper, we present a new procedure to compute FFT in which we save…