An extended Fourier pseudospectral method for the Gross-Pitaevskii equation with low regularity potential
Weizhu Bao, Bo Lin, Ying Ma, Chushan Wang
TL;DR
This work introduces an extended Fourier pseudospectral (eFP) method for the Gross-Pitaevskii equation with low regularity potentials, achieving FS-like accuracy while retaining the computational efficiency of Fourier pseudospectral methods. The key idea is to approximate the nonlinearity by Fourier interpolation and the potential by Fourier projection, enabling fast FFT-based evaluation of the discrete updates. The authors prove optimal $L^2$ and $H^1$ error bounds for the time-splitting eFP scheme under modest regularity assumptions and establish that spatial convergence is optimal with respect to the regularity of the exact solution, while a CFL-type time-step restriction is necessary. Numerical results corroborate the theory, showing superior spatial accuracy for rough potentials and consistent temporal convergence when coupled with time-splitting schemes, with the approach easily adaptable to other temporal integrators. This method offers a robust, efficient tool for simulating Bose-Einstein condensates and related quantum systems with rough potentials.
Abstract
We propose and analyze an extended Fourier pseudospectral (eFP) method for the spatial discretization of the Gross-Pitaevskii equation (GPE) with low regularity potential by treating the potential in an extended window for its discrete Fourier transform. The proposed eFP method maintains optimal convergence rates with respect to the regularity of the exact solution even if the potential is of low regularity and enjoys similar computational cost as the standard Fourier pseudospectral method, and thus it is both efficient and accurate. Furthermore, similar to the Fourier spectral/pseudospectral methods, the eFP method can be easily coupled with different popular temporal integrators including finite difference methods, time-splitting methods and exponential-type integrators. Numerical results are presented to validate our optimal error estimates and to demonstrate that they are sharp as well as to show its efficiency in practical computations.
