Related papers: Fast Computation of Fourier Integral Operators
In [1], we inaugurated a new area of optimal control (OC) theory that we called "periodic fractional OC theory," which was developed to find optimal ways to periodically control a fractional dynamic system. The typical mathematical…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
The numerical solution of implicit and stiff differential equations by implicit numerical integrators has been largely investigated and there exist many excellent efficient codes available in the scientific community, as Radau5 (based on a…
In this work, we present the \emph{twiddless fast Fourier transform (TFFT)}, a novel algorithm for computing the $N$-point discrete Fourier transform (DFT). The TFFT's divide strategy builds on recent results that decimate an $N$-point…
We develop two classes of composite moment-free numerical quadratures for computing highly oscillatory integrals having integrable singularities and stationary points. The first class of the quadrature rules has a polynomial order of…
We establish a general result about the recovery of the analytic wavefront set of a distribution from the analytic wavefront set of its transform coming from a classical elliptic analytic Fourier integral operator (FIO) satisfying some…
Fourier Neural Operators are deep learning models that learn mappings between function spaces and can be used to learn and solve partial differential equations (PDEs), in some cases significantly faster than traditional PDE solvers. Within…
The fast multipole method (FMM) has had great success in reducing the computational complexity of solving the boundary integral form of the Helmholtz equation. We present a formulation of the Helmholtz FMM that uses Fourier basis functions…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
In this paper, we study the impact of computational complexity on the throughput limits of the {\color{black}fast Fourier transform (FFT)} algorithm for {\color{black}orthogonal frequency division multiplexing(OFDM)} waveforms. Based on the…
A common starting point of traditional quantum algorithm design is the notion of a universal quantum computer with a scalable number of qubits. This convenient abstraction mirrors classical computations manipulating finite sets of symbols,…
We propose an implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates. In our implementation, a data sequence is expressed by a tensor product of vector…
We present an algorithm for the efficient numerical evaluation of integrals of the form \[ I(\omega) = \int_0^1 F( x,\mathrm e^{\mathrm i \omega x}; \omega) \, \mathrm d x \] for sufficiently smooth but otherwise arbitrary $F$ and $\omega…
This paper presents a Fourier integral pseudospectral (FIPS) method for a general class of nonlinear, periodic optimal control (OC) problems with equality and/or inequality constraints and sufficiently smooth solutions. In this scheme, the…
This paper introduces a factorization for the inverse of discrete Fourier integral operators that can be applied in quasi-linear time. The factorization starts by approximating the operator with the butterfly factorization. Next, a…
The fractional Fourier transform (FrFT), a fundamental operation in physics that corresponds to a rotation of phase space by any angle, is also an indispensable tool employed in digital signal processing for noise reduction. Processing of…
In the present work, an attempted was made to develop a numerical algorithm by the use of new orthogonal hybrid functions formed from hybrid of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal…
We study the forrelation problem: given a pair of $n$-bit Boolean functions $f$ and $g$, estimate the correlation between $f$ and the Fourier transform of $g$. This problem is known to provide the largest possible quantum speedup in terms…
The precise analysis and accurate measurement of harmonic provides a reliable scientific industrial application. However, the high-performance DSP processor is the important method of electrical harmonic analysis. Hence, in this research…
The plane wave method is most widely used for solving the Kohn-Sham equations in first-principles materials science computations. In this procedure, the three-dimensional (3-dim) trial wave functions' fast Fourier transform (FFT) is a…