Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0903.3266

Conjugate gradient method for finding fundamental solitary waves

Taras I. Lakoba
View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

nlin.PS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taras I. Lakoba. 2009-03-19. Conjugate gradient method for finding fundamental solitary waves. https://doi.org/10.1016/j.physd.2009.09.013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Duck hunting with quantum mechanics

We bridge two sides of singular perturbation theory: the classical theory of slow-fast systems and the semi-classical approach to quantum mechanical systems. For a specific but physically important class of dynamical systems, we show that purely classical and exotic objects, so-called canard solutions, are shadows of instantons in the corresponding quantum system. We demonstrate that canard solutions exist in a domain of parameter space whose boundaries are determined by an instanton action. We illustrate our statements analytically for the relevant example, the overdamped Josephson junction, and confirm them numerically. For the Josephson junction, the canard window is the exponentially narrow gap between consecutive Shapiro steps.

nlin.PS↗
arXiv2026

Rolls and Snaking in a Swift-Hohenberg Equation with Non-smooth Nonlinearity

We study rolls and homoclinic snaking in a variation of the one-dimensional Swift-Hohenberg equation, whose standard forms are prototypical order-parameter models for pattern formation in the sciences. Motivated by classes of differential equation models that involve continuous non-smooth low order nonlinear terms, we replace the standard quadratic-cubic nonlinearity by $ν|u|^α-u^3$, $α\in [1,2]$ with $ν> 0$. In the vicinity of zero, for $α<2$ this nonlinearity falls outside the scope of classical Taylor expansion and bifurcation analysis. Our partially analytical and partially numerical results highlight that the non-smooth term modifies the criticality of pattern-forming bifurcations and alters the associated branches of solutions. In particular, $α\in(1,2)$ implies subcriticality of roll bifurcations for any $ν>0$. At $α=1$ differentiability is lost, which has a strong impact on the bifurcations of sign-changing rolls including the disappearance of homoclinic snaking. Homoclinic snaking thus emerges non-smoothly as $α$ increases from $α=1$, and persists when retaining an additional, e.g., quadratic term.

nlin.PS↗