Efficient Nonlinear Fourier Transform algorithms of orderfFour on equispaced grid

Vishal Vaibhav*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

4 Citations (Scopus)
27 Downloads (Pure)


We explore two classes of exponential integrators, in this letter, to design the nonlinear Fourier transform (NFT) algorithms with a convergence order of four on an equispaced grid. The integrating factor-based method in the class of the Runge-Kutta methods yields algorithms with complexity O(N\log2N) (where N is the number of samples of the signal), which have superior accuracy-complexity tradeoff than any of the fast methods known currently. The integrators based on Magnus series expansion, namely, standard and commutator-free Magnus methods yield the algorithms of complexity O(N2) that have superior error behavior than that of the fast methods.

Original languageEnglish
Pages (from-to)1269-1272
JournalIEEE Photonics Technology Letters
Issue number15
Publication statusPublished - 2019

Bibliographical note

Accepted Author Manuscript


  • Nonlinear Fourier transform
  • Zakharov-Shabat scattering problem


Dive into the research topics of 'Efficient Nonlinear Fourier Transform algorithms of orderfFour on equispaced grid'. Together they form a unique fingerprint.

Cite this