Introducing the fast nonlinear Fourier transform
- 1 May 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 5780-5784
Abstract
The nonlinear Fourier transform (NFT; also: direct scattering transform) is discussed with respect to the focusing nonlinear Schrödinger equation on the infinite line. It is shown that many of the current algorithms for numerical computation of the NFT can be interpreted in a polynomial framework. Finding the continuous spectrum corresponds to polynomial multipoint evaluation in this framework, while finding the discrete eigenvalues corresponds to polynomial root finding. Fast polynomial arithmetic is used in order to derive algorithms that are about an order of magnitude faster than current implementations. In particular, an N sample discretization of the continuous spectrum can be computed with only O(N log 2 N) flops. A finite eigenproblem for the discrete eigenvalues that can be solved in O(N 2 ) is also presented. The feasibility of this approach is demonstrated in a numerical example.Keywords
This publication has 20 references indexed in Scilit:
- A numerical study of the large-period limit of a Zakharov–Shabat eigenvalue problem with periodic potentialsJournal of Physics A: Mathematical and Theoretical, 2012
- Computing spectra of linear operators using the Floquet–Fourier–Hill methodJournal of Computational Physics, 2006
- Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years LaterSIAM Review, 2003
- Finite difference methods for an AKNS eigenproblemMathematics and Computers in Simulation, 1997
- Computation of the direct scattering transform for the nonlinear Schroedinger equationJournal of Computational Physics, 1992
- A fast Laplace transform based on Laguerre functionsMathematics of Computation, 1992
- A fast algorithm for the discrete laplace transformationJournal of Complexity, 1988
- Nonlinear differential–difference equations and Fourier analysisJournal of Mathematical Physics, 1976
- Fast modular transforms via division1972
- The chirp z-transform algorithmIEEE Transactions on Audio and Electroacoustics, 1969