Efficient Nonlinear Fourier Transform Algorithms of Order Four on Equispaced Grid
arXiv:1903.11702 · doi:10.1109/LPT.2019.2925052
Abstract
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 on an equispaced grid. The integrating factor based method in the class of Runge-Kutta methods yield algorithms with complexity (where is the number of samples of the signal) which have superior accuracy-complexity trade-off than any of the fast methods known currently. The integrators based on Magnus series expansion, namely, standard and commutator-free Magnus methods yield algorithms of complexity that have superior error behavior even for moderately small step-sizes and higher signal strengths.
arXiv comment4 pages
References in corpus (6)
- Information Transmission using the Nonlinear Fourier Transform, Part II: Numerical Methods
- Fast Numerical Nonlinear Fourier Transforms
- Fast Inverse Nonlinear Fourier Transformation using Exponential One-Step Methods, Part I: Darboux Transformation
- Fast Inverse Nonlinear Fourier Transform
- Higher Order Convergent Fast Nonlinear Fourier Transform
- Novel Numerical Algorithm with Fourth-Order Accuracy for the Direct Zakharov-Shabat Problem