Fast Algorithm for Quasi-2D Coulomb Systems
Zecheng Gan, Xuanzhao Gao, Jiuyang Liang, Zhenli Xu
TL;DR
Quasi-2D Coulomb systems with partial periodicity pose significant computational challenges due to long-range $1/r$ interactions under slab geometry. The paper introduces RBSE2D, a framework that pairs a sum-of-exponentials (SOE) approximation in the non-periodic $z$-direction with random batch importance sampling in the periodic $xy$-directions, achieving deterministic $O(N^{7/5})$ complexity and, with stochastic batching, an effective $O(N)$ per-step cost. Rigorous error analyses under Debye–Hückel theory, along with comprehensive numerical tests, show substantial accuracy and practical speedups of $2$–$3$ orders of magnitude over conventional Ewald2D methods, enabling MD with up to $10^6$ particles on a single core. The RBSE2D approach is kernel-independent (via kernel-independent SOE, e.g., VPMR) and mesh-free, offering a versatile tool for large-scale simulations of confined Coulomb systems and a blueprint for extending to other partially-periodic lattice kernels. Future directions include handling dielectric mismatch, extending to other ensembles, and leveraging CPU/GPU parallelism to push to even larger scales.
Abstract
Quasi-2D Coulomb systems are of fundamental importance and have attracted much attention in many areas nowadays. Their reduced symmetry gives rise to interesting collective behaviors, but also brings great challenges for particle-based simulations. Here, we propose a novel algorithm framework to address the $O(N^2)$ simulation complexity associated with the long-range nature of Coulomb interactions. First, we introduce an efficient Sum-of-Exponentials (SOE) approximation for the long-range kernel associated with Ewald splitting, achieving uniform convergence in terms of inter-particle distance, which reduces the complexity to $O(N^{7/5})$. We then introduce a random batch sampling method in the periodic dimensions, the stochastic approximation is proven to be both unbiased and with reduced variance via a tailored importance sampling strategy, further reducing the computational cost to $O(N)$. The performance of our algorithm is demonstrated via various numerical examples. Notably, it achieves a speedup of $2\sim 3$ orders of magnitude comparing with Ewald2D method, enabling molecular dynamics (MD) simulations with up to $10^6$ particles on a single core. The present approach is therefore well-suited for large-scale particle-based simulations of Coulomb systems under confinement, making it possible to investigate the role of Coulomb interaction in many practical situations.
