Related papers: A fast FFT-based discrete Legendre transform
This proposal relates to the design, analysis and application of a novel numerical scheme for the solution of axisymmetric scattering problems. To this end, a procedure is introduced to iteratively evaluate the solution of the…
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 well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various…
Exponential divided differences arise in numerical linear algebra, matrix-function evaluation, and quantum Monte Carlo simulations, where they serve as kernel weights for time evolution and observable estimation. Efficient and numerically…
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…
We introduce a new method with spectral accuracy to solve linear non-autonomous ordinary differential equations (ODEs) of the kind $ \frac{d}{dt}\tilde{u}(t) = \tilde{f}(t) \tilde{u}(t)$, $\tilde{u}(-1)=1$, with $\tilde{f}(t)$ an analytic…
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…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
We explore two classes of exponential integrators in this letter to design nonlinear Fourier transform (NFT) algorithms with a desired accuracy-complexity trade-off and a convergence order of $4$ on an equispaced grid. The integrating…
This research deals with the numerical solution of non-linear fractional differential equations with delay using the method of steps and shifted Legendre (Chebyshev) collocation method. This article aims to present a new formula for the…
We present a new method for computing the Near-To-Far-Field (NTFF) transformation in FDTD simulations which has an overall scaling of $O(N^3)$ instead of the standard $O(N^4)$. By mapping the far field with a cartesian coordinate system the…
The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity…
Classical density functional theory (DFT) of fluids is a valuable tool to analyze inhomogeneous fluids. However, few numerical solution algorithms for three-dimensional systems exist. Here we present an efficient numerical scheme for fluids…
We present a quasi-linearly scaling, first order polynomial finite element method for the solution of the magnetostatic open boundary problem by splitting the magnetic scalar potential. The potential is determined by solving a Dirichlet…
This paper is devoted to the efficient numerical solution of the Helmholtz equation in a two- or three-dimensional rectangular domain with an absorbing boundary condition (ABC). The Helmholtz problem is discretized by standard bilinear and…
In this paper, a new deep-learning architecture for solving the non-linear Falkner-Skan equation is proposed. Using Legendre and Chebyshev neural blocks, this approach shows how orthogonal polynomials can be used in neural networks to…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
Discrete Fourier transform (DFT) is the base of modern signal or information processing. 1-Dimensional fast Fourier transform (1D FFT) and 2D FFT have time complexity O(NlogN) and O(N^2logN) respectively. Quantum 1D and 2D DFT algorithms…
The nonlinear Fourier transform (NLFT) extends the classical Fourier transform by replacing addition with matrix multiplication. While the NLFT on $\mathrm{SU}(1,1)$ has been widely studied, its $\mathrm{SU}(2)$ variant has only recently…
In this letter, a fast Fourier transform (FFT)-enhanced low-complexity super-resolution sensing algorithm for near-field source localization with both angle and range estimation is proposed. Most traditional near-field source localization…