Reliable computation of the eigenvalues of the discrete KdV spectrum
Peter J. Prins (TU Delft - Team Gabriel Gleizer)
Sander Wahls (TU Delft - Team Gabriel Gleizer)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
We propose a numerical algorithm that computes the eigenvalues of the Korteweg–de Vries equation (KdV) from sampled input data with vanishing boundary conditions. It can be used as part of the Non-linear Fourier Transform (NFT) for the KdV equation. The algorithm that we propose makes use of Sturm-Liouville (SL) oscillation theory to guaranty that all eigenvalues are found. In comparison to similar available algorithms, we show that our algorithm is more robust to numerical errors and thus more reliable. Furthermore we show that our root finding algorithm, which is based on the Newton–Raphson (NR) algorithm, typically saves computation time compared to the conventional approaches that rely heavily on bisection.
help_outline