Jacobi-Gauss-Lobatto collocation method for the numerical solution of 1+1 nonlinear Schrödinger equations

  • Authors:
  • E. H. Doha;A. H. Bhrawy;M. A. Abdelkawy;Robert A. Van Gorder

  • Affiliations:
  • Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt;Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah, Saudi Arabia and Department of Mathematics, Faculty of Science, Beni-Suef University, Beni-Suef, Egypt;Department of Mathematics, Faculty of Science, Beni-Suef University, Beni-Suef, Egypt;Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA

  • Venue:
  • Journal of Computational Physics
  • Year:
  • 2014

Quantified Score

Hi-index 31.45

Visualization

Abstract

A Jacobi-Gauss-Lobatto collocation (J-GL-C) method, used in combination with the implicit Runge-Kutta method of fourth order, is proposed as a numerical algorithm for the approximation of solutions to nonlinear Schrodinger equations (NLSE) with initial-boundary data in 1+1 dimensions. Our procedure is implemented in two successive steps. In the first one, the J-GL-C is employed for approximating the functional dependence on the spatial variable, using (N-1) nodes of the Jacobi-Gauss-Lobatto interpolation which depends upon two general Jacobi parameters. The resulting equations together with the two-point boundary conditions induce a system of 2(N-1) first-order ordinary differential equations (ODEs) in time. In the second step, the implicit Runge-Kutta method of fourth order is applied to solve this temporal system. The proposed J-GL-C method, used in combination with the implicit Runge-Kutta method of fourth order, is employed to obtain highly accurate numerical approximations to four types of NLSE, including the attractive and repulsive NLSE and a Gross-Pitaevskii equation with space-periodic potential. The numerical results obtained by this algorithm have been compared with various exact solutions in order to demonstrate the accuracy and efficiency of the proposed method. Indeed, for relatively few nodes used, the absolute error in our numerical solutions is sufficiently small.