Fast inverse nonlinear Fourier transform

Abstract

This paper considers the non-Hermitian Zakharov-Shabat scattering problem which forms the basis for defining the SU(2)-nonlinear Fourier transform (NFT). The theoretical underpinnings of this generalization of the conventional Fourier transform is quite well established in the Ablowitz-Kaup-Newell-Segur formalism; however, efficient numerical algorithms that could be employed in practical applications are still unavailable. In this paper, we present two fast inverse NFT algorithms with O(KN+Nlog^{2}N) complexity and a convergence rate of O(N^{-2}), where N is the number of samples of the signal and K is the number of eigenvalues. These algorithms are realized using a new fast layer-peeling (LP) scheme [O(Nlog^{2}N)] together with a new fast Darboux transformation (FDT) algorithm [O(KN+Nlog^{2}N)] previously developed by V. Vaibhav [Phys. Rev. E 96, 063302 (2017)2470-004510.1103/PhysRevE.96.063302]. The proposed fast inverse NFT algorithm proceeds in two steps: The first step involves computing the radiative part of the potential using the fast LP scheme for which the input is synthesized under the assumption that the radiative potential is nonlinearly bandlimited, i.e., the continuous spectrum has a compact support. The second step involves addition of bound states using the FDT algorithm. Finally, the performance of these algorithms is demonstrated through exhaustive numerical tests.