This paper presents several numerical techniques to generate solitary-wave profiles of the Benjamin equation. The formulation and implementation of the methods focus on some specific points of the problem: on the one hand, the approximation of the nonlocal term is accomplished by Fourier techniques, which determine the spatial discretization used in the experiments. On the other hand, in the numerical continuation procedure suggested by the derivation of the model and already discussed in the literature, several algorithms for solving the nonlinear systems are described and implemented: the Petviashvili method, the Preconditioned Conjugate Gradient Newton method and two Squared-Operator methods. A comparative study of these algorithms is made in the case of the Benjamin equation; Newton's method combined with Preconditioned Conjugate Gradient techniques, emerges as the most efficient. The resulting numerical profiles are shown to have a high accuracy as travelling-wave solutions when they are used as initial conditions in a time-stepping procedure for the Benjamin equation. The paper also explores the generation of multi-pulse solitary waves.
['Vassilios A. Dougalis', 'A. Durán', 'D.E. Mitsotakis']
Numerical approximation of solitary waves of the Benjamin equation