Efficient Nonlinear Fourier Transform Algorithms of Order Four on Equispaced Grid

DOI10.1109/LPT.2019.2925052MaRDI QIDQ6316309zbMATH OpenFDO

Authors Vishal Vaibhav

Publication date 26 March 2019

Full work available at URL https://doi.org/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 $4$ on an equispaced grid. The integrating factor based method in the class of Runge-Kutta methods yield algorithms with complexity $O(Nlo{g}^{2}N)$ (where $N$ 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 $O(N^2)$ that have superior error behavior even for moderately small step-sizes and higher signal strengths.

Cited in

(1)

• Fast eight-order Pade schemes based on Chebyshev polynomials for direct Zakharov-Shabat problem

This page was built for publication: Efficient Nonlinear Fourier Transform Algorithms of Order Four on Equispaced Grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6316309)