Results 1 to 10 of about 1,127,317 (169)
We consider the problem of computing the Fourier transform of high-dimensional vectors, distributedly over a cluster of machines consisting of a master node and multiple worker nodes, where the worker nodes can only store and process a fraction of the inputs.
Yu, Qian +2 more
openaire +3 more sources
Quantum Fourier transform revisited [PDF]
SummaryThe fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a particular matrix decomposition of the discrete Fourier transform (DFT) matrix.
Daan Camps, Roel Van Beeumen, Chao Yang
openaire +8 more sources
A caveat about applications of the unilateral Fourier transform [PDF]
It is presented a warning about the erroneous use of unilateral Fourier transform with nonhomogeneous Dirichlet or Neumann boundary conditions in a well-known textbook on integral transforms, and also in a few papers recently diffused in the literature.
Antonio S. de Castro
doaj +2 more sources
AbstractThe paper deals with the problem under which conditions for the parameters $$s_1,s_2\in \mathbb R$$ s 1 , s 2 ∈
Dorothee D. Haroske +2 more
openaire +2 more sources
More on the quantum harmonic oscillator via unilateral Fourier transform [PDF]
The stationary states of the quantum harmonic oscillator are properly determined by means of the unilateral Fourier transform without having to recourse to the properties of the confluent hypergeometric functions. This simpler procedure is reminiscent of
Douglas Willian Vieira +1 more
doaj +1 more source
Nonlinearizad of Fast Fourier Transform
A unified mathematical form of reversible nonlinear transformations based on a nonlinear tensor product is presented in the form of fast algorithms.
Valeriy Labunets +2 more
doaj +1 more source
Quantum Weighted Fractional Fourier Transform
Quantum Fourier transform (QFT) is an important part of many quantum algorithms. However, there are few reports on quantum fractional Fourier transform (QFRFT).
Tieyu Zhao, Tianyu Yang, Yingying Chi
doaj +1 more source
Fourier ptychography algorithm based on scaled Fourier transform
This letter discusses an alternative Fourier ptychography algorithm based on the scaled fast Fourier transform propagation. The advantage of this scheme is that it enables a zoom‐in capability of the object spectrum and complex pupil within the synthetic
Mojde Hasanzade +3 more
doaj +1 more source
Discrete Fourier transform and permutations [PDF]
It is well known that the magnitudes of the coefficients of the discrete Fourier transform (DFT) are invariant under certain operations on the input data. In this paper, the effects of rearranging the elements of an input data on its DFT are studied.
S. Hui, S.H. Żak
doaj +1 more source
Multiweighted-Type Fractional Fourier Transform: Unitarity
The definition of the discrete fractional Fourier transform (DFRFT) varies, and the multiweighted-type fractional Fourier transform (M-WFRFT) is its extended definition. It is not easy to prove its unitarity.
Tieyu Zhao, Yingying Chi
doaj +1 more source

