Riemannian optimisation methods for ground states of multicomponent Bose-Einstein condensates
R. Altmann, M. Hermann, D. Peterseim, T. Stykel
TL;DR
This work develops a comprehensive Riemannian-geometry framework for computing ground states of multicomponent Bose–Einstein condensates by formulating constrained energy minimisation on the infinite-dimensional generalised oblique manifold. It establishes existence and uniqueness (up to scaling) of ground states, and connects the problem to a nonlinear eigenvector formulation, enabling gradient- and Newton-type optimisation on manifolds with multiple metric choices, including energy-adaptive and Lagrangian-based preconditioners. The paper proves global convergence for the energy-adaptive Riemannian gradient descent method and analyzes local convergence, while demonstrating substantial computational gains through numerical experiments in 1D and 2D. The results show that Riemannian methods, especially with problem-tailored metrics and alternating strategies, robustly identify ground states across discretisations and potential landscapes, highlighting a path toward efficient simulations of complex multicomponent quantum systems.
Abstract
This paper addresses the computation of ground states of multicomponent Bose-Einstein condensates, defined as the global minimiser of an energy functional on an infinite-dimensional generalised oblique manifold. We establish the existence of the ground state, prove its uniqueness up to scaling, and characterise it as the solution to a coupled nonlinear eigenvector problem. By equipping the manifold with several Riemannian metrics, we introduce a suite of Riemannian gradient descent and Riemannian Newton methods. Metrics that incorporate first- or second-order information about the energy are particularly advantageous, effectively preconditioning the resulting methods. For a Riemannian gradient descent method with an energy-adaptive metric, we provide a qualitative global and quantitative local convergence analysis, confirming its reliability and robustness with respect to the choice of the spatial discretisation. Numerical experiments highlight the computational efficiency of both the Riemannian gradient descent and Newton methods.
