Related papers: Fast Nonlinear Fourier Transform using Chebyshev P…
Coupled nonlinear Schr\"odinger equations model various physical phenomena, such as wave propagation in nonlinear optics, multi-component Bose-Einstein condensates, and shallow water waves. Despite their extensive applications, analytical…
The Discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm. One remarkable feature of FFT is the fact that its runtime…
In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal…
We present a novel and unifying framework for constructing spectral approximations to fractional integral operators. These spectral approximations are based on transplanted Chebyshev polynomials, which are obtained by composing Chebyshev…
We compare exponential-type integrators for the numerical time-propagation of the equations of motion arising in the multi-configuration time-dependent Hartree-Fock method for the approximation of the high-dimensional multi-particle…
A variety of techniques have been developed for the approximation of non-periodic functions. In particular, there are approximation techniques based on rank-$1$ lattices and transformed rank-$1$ lattices, including methods that use sampling…
Discrete transforms such as the discrete Fourier transform (DFT) or the discrete Hartley transform (DHT) furnish an indispensable tool in signal processing. The successful application of transform techniques relies on the existence of the…
For the approximation of solutions for stochastic partial differential equations, numerical methods that obtain a high order of convergence and at the same time involve reasonable computational cost are of particular interest. We therefore…
In this paper we explain how to use the Fast Fourier Transform (FFT) to solve partial differential equations (PDEs). We start by defining appropriate discrete domains in coordinate and frequency domains. Then describe the main limitation of…
Time integration of Fourier pseudo-spectral DNS is usually performed using the classical fourth-order accurate Runge--Kutta method, or other methods of second or third order, with a fixed step size. We investigate the use of higher-order…
We discuss a numerical algorithm for solving nonlinear integro-differential equations, and illustrate our findings for the particular case of Volterra type equations. The algorithm combines a perturbation approach meant to render 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…
This summary of the doctoral thesis provides a comprehensive formulation of the Extended Discrete Fourier Transform (EDFT), derived directly from the Fourier integral and its orthogonality properties. The method is obtained by solving…
The so-called non-uniform FFT (NFFT) is a family of algorithms for efficiently computing the Fourier transform of finite-length signals, whenever the time or frequency grid is nonuniformly spaced. Following the usual classification, there…
A novel class of high-order linearly implicit energy-preserving integrating factor Runge-Kutta methods are proposed for the nonlinear Schr\"odinger equation. Based on the idea of the scalar auxiliary variable approach, the original equation…
We consider the solution of large stiff systems of ordinary differential equations with explicit exponential Runge--Kutta integrators. These problems arise from semi-discretized semi-linear parabolic partial differential equations on…
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…
This paper is devoted to a discussion of the Discrete Fourier Transform (DFT) representation of a chaotic finite-duration sequence. This representation has the advantage that is itself a finite-duration sequence corresponding to samples…
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…
Matrix evolution equations occur in many applications, such as dynamical Lyapunov/Sylvester systems or Riccati equations in optimization and stochastic control, machine learning or data assimilation. In many such problems, the dominant…