Conjugate gradient method for finding fundamental solitary waves

Nonlinear Sciences – Pattern Formation and Solitons

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

44 pages, submitted to Physica D

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Conjugate gradient method for finding fundamental solitary waves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Conjugate gradient method for finding fundamental solitary waves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Conjugate gradient method for finding fundamental solitary waves will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-648179

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.