Conjugate gradient method for finding fundamental solitary waves

Abstract

The Conjugate Gradient method (CGM) is known to be the fastest generic iterative method for solving linear systems with symmetric sign definite matrices. In this paper, we modify this method so that it could find fundamental solitary waves of nonlinear Hamiltonian equations. The main obstacle that such a modified CGM overcomes is that the operator of the equation linearized about a solitary wave is not sign definite. Instead, it has a finite number of eigenvalues on the opposite side of zero than the rest of its spectrum. We present versions of the modified CGM that can find solitary waves with prescribed values of either the propagation constant or power. We also extend these methods to handle multi-component nonlinear wave equations. Convergence conditions of the proposed methods are given, and their practical implications are discussed. We demonstrate that our modified CGMs converge much faster than, say, Petviashvili's or similar methods, especially when the latter converge slowly.

44 pages, submitted to Physica D

References in corpus (5)

• A generalized Petviashvili iteration method for scalar and vector Hamiltonian equations with arbitrary form of nonlinearity
• Qualitative and quantitative analysis of stability and instability dynamics of positive lattice solitons
• Solitary Waves Bifurcated from Bloch Band Edges in Two-dimensional Periodic Media
• A mode elimination technique to improve convergence of iteration methods for finding solitary waves
• Rayleigh functional for nonlinear systems

Cited by in corpus (4)

• Branch cuts of Stokes wave on deep water. Part I: Numerical solution and Padé approximation
• An extended Petviashvili method for the numerical generation of traveling and localized waves
• Two-color soliton meta-atoms and molecules
• Efficient simulations of Hartree--Fock equations by an accelerated gradient descent method