Related papers: Non-iterative Type 4 and 5 Nonuniform FFT Methods …
Addressing the optical communication systems employing the nonlinear Fourier transform (NFT) for the data modulation/demodulation, we provide an explicit proof for the properties of the signals emerging in the so-called b-modulation method,…
Efficient estimators of Fourier-space statistics for large number of objects rely on Fast Fourier Transforms (FFTs), which are affected by aliasing from unresolved small scale modes due to the finite FFT grid. Aliasing takes the form of a…
This article develops how to generalize the invariant subspace method for deriving the analytical solutions of the multi-component (N+1)-dimensional coupled nonlinear time-fractional PDEs (NTFPDEs) in the sense of Caputo fractional-order…
We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the…
Frequency estimation is a fundamental problem in many areas. The well-known A&M and its variant estimators have established an estimation framework by iteratively interpolating the discrete Fourier transform (DFT) coefficients. In general,…
We develop the uniform sparse Fast Fourier Transform (usFFT), an efficient, non-intrusive, adaptive algorithm for the solution of elliptic partial differential equations with random coefficients. The algorithm is an adaption of the sparse…
The quadratic phase Fourier transform (QPFT) is a generalization of several well-known integral transforms, including the linear canonical transform (LCT), fractional Fourier transform (FrFT), and Fourier transform (FT). This paper…
We describe a family of iterative algorithms that involve the repeated execution of discrete and inverse discrete Fourier transforms. One interesting member of this family is motivated by the discrete Fourier transform uncertainty principle…
This paper presents the first parallel implementation of the novel "Interpolated Factored Green Function" (IFGF) method introduced recently for the accelerated evaluation of discrete integral operators arising in wave scattering and other…
Recently, fractional differential equations have been investigated via the famous variational iteration method. However, all the previous works avoid the term of fractional derivative and handle them as a restricted variation. In order to…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
Nonequispaced discrete Fourier transformation (NDFT) is widely applied in all aspects of computational science and engineering. The computational efficiency and accuracy of NDFT has always been a critical issue in hindering its…
A nonlinear algebraic equation system of 5 variables is numerically solved, which is derived from the application of the Fourier transform to a differential equation system that allows modeling the behavior of the temperatures and the…
A new iterative method for non-LTE multilevel polarized radiative transfer in hydrogen lines is presented. Iterative methods (such as the Jacobi method) tend to damp out high-frequency components of the error fast, but converges poorly due…
We present a parallel version of the well-known Split-Step Fourier method (SSF) for solving the Nonlinear Schr\"odinger equation, a mathematical model describing wave packet propagation in fiber optic lines. The algorithm is implemented…
After a brief review of the Fermi-Pasta-Ulam (FPU) conservative system of N nonlinearly coupled oscillators, this paper addresses two problems: first, comparing two indicators for the equipartition, showing that the results are essentially…
Modeling the large-scale structure of the universe on nonlinear scales has the potential to substantially increase the science return of upcoming surveys by increasing the number of modes available for model comparisons. One way to achieve…
In some of the problems, complicated functions of the Z-transform variable, $z$, appear which either cannot be inverted analytically or the required calculations are quite tedious. In such cases numerical methods should be used to find the…
The nonlinear Fourier transform, which is also known as the forward scattering transform, decomposes a periodic signal into nonlinearly interacting waves. In contrast to the common Fourier transform, these waves no longer have to be…
The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…