arXiv · 1908.09811
Fast Nonlinear Fourier Transform using Chebyshev Polynomials
Abstract
We explore the class of exponential integrators known as exponential time differencing (ETD) method in this letter to design low complexity nonlinear Fourier transform (NFT) algorithms that compute discrete approximations of the scattering coefficients in terms of the Chebyshev polynomials for real values of the spectral parameter. In particular, we discuss ETD Runge-Kutta methods which yield algorithms with complexity $O(N\log^2N)$ (where $N$ is the number of samples of the signal) and an order of convergence that matches the underlying one-step method.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Vishal Vaibhav. 2019-08-26. Fast Nonlinear Fourier Transform using Chebyshev Polynomials. https://arxiv.org/abs/1908.09811
Cite the original work for its findings. Save a collection to share your selection of sources.