相关论文: A fast and accurate numerical method for the symme…

In this paper, we consider a method for fast numerical computation of the Fourier transform of a slowly decaying function with given accuracy in given ranges of the frequency. In these decades, some useful formulas for the Fourier transform…

In this article, we present an $O(N \log N)$ rapidly convergent algorithm for the numerical approximation of the convolution integral with radially symmetric weakly singular kernels and compactly supported densities. To achieve the reduced…

Computationally efficient numerical methods for high-order approximations of convolution integrals involving weakly singular kernels find many practical applications including those in the development of fast quadrature methods for…

Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…

The special unitary group SU(2) plays a fundamental role in the description of symmetries in quantum mechanics, theoretical physics, and spherical signal processing. In this paper, we address the computational challenges of performing…

We present an efficient and very flexible numerical fast Fourier-Laplace transform, that extends the logarithmic Fourier transform (LFT) introduced by Haines and Jones [Geophys. J. Int. 92(1):171 (1988)] for functions varying over many…

We present numerical methods based on the fast Fourier transform (FFT) to solve convolution integral equations on a semi-infinite interval (Wiener-Hopf equation) or on a finite interval (Fredholm equation). We extend and improve a FFT-based…

The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n log n) instead of O(n 2) arithmetic operations. Graph Signal Processing (GSP) is a recent…

We consider the numerical integration of the Gross-Pitaevskii equation with a potential trap given by a time-dependent harmonic potential or a small perturbation thereof. Splitting methods are frequently used with Fourier techniques since…

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…

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…

In this paper, we introduce a fast Fourier-Galerkin method for solving boundary integral equations on torus-shaped surfaces, which are diffeomorphic to a torus. We analyze the properties of the integral operator's kernel to derive the decay…

We introduce a Fourier-based fast algorithm for Gaussian process regression in low dimensions. It approximates a translationally-invariant covariance kernel by complex exponentials on an equispaced Cartesian frequency grid of $M$ nodes.…

For the approximation and simulation of twofold iterated stochastic integrals and the corresponding L\'{e}vy areas w.r.t. a multi-dimensional Wiener process, we review four algorithms based on a Fourier series approach. Especially, the very…

We give two algebro-geometric inspired approaches to fast algorithms for Fourier transforms in algebraic signal processing theory based on polynomial algebras in several variables. One is based on module induction and one is based on a…

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…

In his monograph Chebyshev and Fourier Spectral Methods, John Boyd claimed that, regarding Fourier spectral methods for solving differential equations, ``[t]he virtues of the Fast Fourier Transform will continue to improve as the relentless…

We propose a fast collocation method based on Krylov subspace iterative solver on general nonuniform grids for the fractional Laplacian problem, in which the fractional operator is presented in a singular integral formulation. The method is…

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…

We propose Fourier transform (FT) method for processing images of extensive air showers (EAS) detected by imaging atmospheric Cherenkov telescopes (IACT) used in the very high energy (VHE) gamma-ray astronomy. The method is based on the…