CUDA programs for solving the time-dependent dipolar Gross–Pitaevskii equation in an anisotropic trap

• DOI: 10.1016/j.cpc.2015.11.014
• Publication Date: 2015-12-18T00:21:30Z
• Authors: Vladimir Lončar; Antun Balaž; Aleksandar Bogojević; Srdjan Škrbić; Paulsamy Murugana...; Sadhan K. Adhikari
• Keywords: GPU; Real- and imaginary-time propagation; FOS: Physical sciences; Pattern Formation and Solitons (nlin.PS); CUDA program; Split-step Crank–Nicolson scheme; 01 natural sciences; 0103 physical sciences; 518; Dipolar atoms; Quantum Physics; Bose–Einstein condensate; 005; Partial differential equation; Computational Physics (physics.comp-ph); Nonlinear Sciences - Pattern Formation and Solitons; C program; Quantum Gases (cond-mat.quant-gas); Gross–Pitaevskii equation; Condensed Matter - Quantum Gases; Quantum Physics (quant-ph); Physics - Computational Physics

7 pages, 2 figures; to download the programs, click "Other formats" and download the source<br/>In this paper we present new versions of previously published numerical programs for solving the dipolar Gross-Pitaevskii (GP) equation including the contact interaction in two and three spatial dimensions in imaginary and in real time, yielding both stationary and non-stationary solutions. New versions of programs were developed using CUDA toolkit and can make use of Nvidia GPU devices. The algorithm used is the same split-step semi-implicit Crank-Nicolson method as in the previous version (R. Kishor Kumar et al., Comput. Phys. Commun. 195, 117 (2015)), which is here implemented as a series of CUDA kernels that compute the solution on the GPU. In addition, the Fast Fourier Transform (FFT) library used in the previous version is replaced by cuFFT library, which works on CUDA-enabled GPUs. We present speedup test results obtained using new versions of programs and demonstrate an average speedup of 12 to 25, depending on the program and input size.<br/>