Results 41 to 50 of about 2,594,498 (363)
Fast Computation of Singular Oscillatory Fourier Transforms
Abstract and Applied Analysis, 2014 We consider the problem of the numerical evaluation of singular oscillatory Fourier transforms ∫abx-aαb-xβf(x)eiωxdx, where α>-1 and β>-1. Based on substituting the original interval of integration by the paths of steepest descent, if f is analytic ...
Hongchao Kang, Xinping Shao
doaj +1 more source
Large Fourier transforms never exactly realized by braiding conformal blocks [PDF]
, 2006 Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1, \omega=e ...
M. A. Niesen +6 more
core +1 more source
Steerable Discrete Fourier Transform
, 2017 Directional transforms have recently raised a lot of interest thanks to their numerous applications in signal compression and analysis. In this letter, we introduce a generalization of the discrete Fourier transform, called steerable DFT (SDFT).
Fracastoro, Giulia, Magli, Enrico
core +1 more source
Fourier-Mukai transforms [PDF]
, 2007 Suggestions by many people incorporated (see the acknowledgement at the end of the introduction)
Hille, Lutz, Bergh, Michel Van den
openaire +2 more sources
Clifford algebras, Fourier transforms and quantum mechanics [PDF]
, 2012 In this review, an overview is given of several recent generalizations of the Fourier transform, related to either the Lie algebra sl_2 or the Lie superalgebra osp(1|2).
H. Bie
semanticscholar +1 more source
Multi-dimensional real Fourier transform [PDF]
, 1971 Four subroutines compute one-dimensional and multi-dimensional Fourier transforms for real data, multi-dimensional complex Fourier transforms, and multi-dimensional sine, cosine and sine-cosine transforms.
Krogh, F. T.
core +1 more source
FEBS Open Bio, EarlyView.This research protocol outlines a workflow for nuclear magnetic resonance (NMR)‐based metabolomics in the agri‐food sector. Using two case studies—strawberry leaves (solid matrix) and wine (liquid matrix)—it details the procedures for sample preparation, data acquisition, and processing.
Andrea Fernández‐Veloso +4 more
wiley +1 more source
Novel Fourier quadrature transforms and analytic signal representations for nonlinear and non-stationary time-series analysis [PDF]
Royal Society Open Science, 2018 The Hilbert transform (HT) and associated Gabor analytic signal (GAS) representation are well known and widely used mathematical formulations for modelling and analysis of signals in various applications.
Pushpendra Singh
doaj +1 more source
Efficient Algorithm for Finding Roots of Error-Locator Polynomials
IEEE Access, 2021 A novel method for finding roots of polynomials over finite fields has been proposed. This method is based on the cyclotomic discrete Fourier transform algorithm. The improvement is achieved by using the normalized cyclic convolutions, which have a small
Sergei Valentinovich Fedorenko
doaj +1 more source
Quantum Fourier transform revisited
Numerical Linear Algebra with Applications, 2020 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 +6 more sources