An Efficient Nonlinear Fourier Transform Algorithm for Detection of Eigenvalues from Continuous Spectrum

2018/12/05 by Aref, Vahid, Le, Son T., Buelow, Henning
#FOS: Computer and information sciences #FOS: Electrical engineering #Information Theory (cs.IT) #Signal Processing (eess.SP) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.1812.02092

Abstract

We present an efficient, fast and robust Nonlinear Fourier Transform (NFT) algorithm to detect eigenvalues of the discrete spectrum. It outperforms other known NFT algorithms as it detects the eigenvalues from the continuous spectrum, the numerically more robust part of the nonlinear spectrum.

Related

• A Fast Chebyshev Spectral Method for Nonlinear Fourier Transform
• Control and Detection of Discrete Spectral Amplitudes in Nonlinear Fourier Spectrum
• Fast Nonlinear Fourier Transform using Chebyshev Polynomials
• Explicit Hermite-type eigenvectors of the discrete Fourier transform
• Sparse Eigenvectors of the Discrete Fourier Transform