Iteration methods for stability spectra of solitary waves

Authors:
Jianke Yang
Affiliations:
Department of Mathematics and Statistics, University of Vermont, Burlington, VT 05401, United States
Venue:
Journal of Computational Physics
Year:
2008

Citing 6
Cited 1

Implicit application of polynomial filters in a k-step Arnoldi method

SIAM Journal on Matrix Analysis and Applications
Spectral methods in MatLab

Spectral methods in MatLab
Optimizing Schrödinger Functionals Using Sobolev Gradients: Applications to Quantum Mechanics and Nonlinear Optics

SIAM Journal on Scientific Computing
Why Newton's method is hard for travelling waves: Small denominators, KAM theory, Arnold's linear Fourier problem, non-uniqueness, constraints and erratic failure

Mathematics and Computers in Simulation
A generalized Petviashvili iteration method for scalar and vector Hamiltonian equations with arbitrary form of nonlinearity

Journal of Computational Physics
A mode elimination technique to improve convergence of iteration methods for finding solitary waves

Journal of Computational Physics

Original article: Lanczos-Chebyshev pseudospectral methods for wave-propagation problems

Mathematics and Computers in Simulation

Quantified Score

Hi-index	31.45

Visualization

Abstract

Three iteration methods are proposed for the computation of eigenvalues and eigenfunctions in the linear stability of solitary waves. These methods are based on iterating certain time evolution equations associated with the linear stability eigenvalue problem. The first method uses the fourth-order Runge-Kutta method to iterate the pre-conditioned linear stability operator, and it usually converges to the most unstable eigenvalue of the solitary wave. The second method uses the Euler method to iterate the ''square'' of the pre-conditioned linear stability operator. This method is shown to converge to any discrete eigenvalue in the stability spectrum. The third method is obtained by incorporating the mode elimination technique into the second method, which speeds up the convergence considerably. These methods are applied to various examples of physical interest, and are found to be efficient, easy to implement, and low in memory usage.