Discrete normalized gradient flow for two-component Bose-Einstein condensates: Energy dissipation, global convergence and sharp local convergence behavior
math.NA, cond-mat.quant-gas, cs.NA
Submitted: 2025-10-22
Updated: 2026-09-24
License: http://creativecommons.org/licenses/by/4.0/
The gist: The gradient flow with semi-implicit discretization (GFSI) is the most widely used algorithm for computing the ground state of Gross-Pitaevskii energy functional.
Terminology
Abstract
The gradient flow with semi-implicit discretization (GFSI) is the most widely used algorithm for computing the ground state of Gross-Pitaevskii energy functional. We apply GFSI to the two-component scenario with Josephson junction and rotating term, which is one of the most important and topical models in multi-component Bose-Einstein condensates (MBECs), and rigorously establish the following fundamental results for the first time. By introducing a Lagrange multiplier to reformulate GFSI into an equivalent form, we prove its energy dissipation property and global convergence to stationary states. More significantly, we uncover an intrinsic connection between this classical numerical PDE discretization rooted in imaginary-time evolution and Riemannian optimization, a state-of-the-art mathematical framework for manifold-constrained optimization. This connection enables us to fully characterize the local convergence behavior of GFSI within the Riemannian optimization framework. Together with the aforementioned global convergence result, this yields a complete global--local convergence theory for GFSI. Finally, numerical experiments comprehensively validate the theoretically predicted energy dissipation and convergence properties.
Sources
- Riemannian optimisation methods for ground states of multicomponent Bose-Einstein condensates
- Convergence of a Riemannian gradient method for the Gross-Pitaevskii energy functional in a rotating frame
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers
- Data-efficient Kernel Methods for Learning Hamiltonian Systems
- Adjoint Method versus Physics-Informed Neural Networks in PDE-Constrained Inverse Problems