Metraipolis › archive › dc_ac7eea41bf1f
Global convergence of an efficient splitting method for the defocusing Gross--Pitaevskii ground state problem — arXiv:2609.13509
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.13509
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T00:39:24.562Z
- SHA-256 of the archived text
ebe578f0ca14580f9b75c67712f30740d875ed28ff1e31337a872e505acec9f8- Stable URL of this page
https://metraipolis.com/documento/dc_ac7eea41bf1f
How to cite
Global convergence of an efficient splitting method for the defocusing Gross--Pitaevskii ground state problem — arXiv:2609.13509 — arXiv (en), https://arxiv.org/abs/2609.13509 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ac7eea41bf1f (Metraipolis archive dc_ac7eea41bf1f, sha256 ebe578f0ca14580f9b75c67712f30740d875ed28ff1e31337a872e505acec9f8)
BibTeX
@misc{dcac7eea41bf1f,
title = {Global convergence of an efficient splitting method for the defocusing Gross--Pitaevskii ground state problem — arXiv:2609.13509},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.13509},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ac7eea41bf1f; sha256 ebe578f0ca14580f9b75c67712f30740d875ed28ff1e31337a872e505acec9f8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13509. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For computing the ground state of the defocusing Gross--Pitaevskii energy, we propose and analyze two efficient schemes based on the Davis--Yin three-operator splitting, which treats the potential and interaction terms explicitly, and the kinetic energy by a resolvent. One iteration costs one inversion of $I-\gamma\Delta$ for the first scheme, and of $I-\gamma\Delta+\gamma V_1$ for the second, with $V_1$ denoting the separable part of the potential, and on structured meshes both operators can be inverted by simple fast GPU solvers. For monotone discrete Laplacians, including the second-order finite difference scheme and the lumped linear finite element method on simplicial meshes with suitable angle conditions, we prove global convergence to the unique positive discrete ground state, for every positive normalized initial vector, for any constant step size below an explicit threshold. In contrast, the methods previously proven to converge globally to the ground state all invert a more difficult elliptic operator that depends on the iteration variable. In three-dimensional tests with up to $999^3$ unknowns on one GPU, a simple variable step size rule makes the proposed splitting schemes efficient in practice, comparable in wall-clock time to Riemannian conjugate gradient methods that also invert only a shifted Laplacian operator, and much more robust with respect to the choice of the initial guess. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.OC). Categorie arXiv: Numerical Analysis (math.NA) ; Optimization and Control (math.OC); Computational Physics (physics.comp-ph). Pagina del lavoro: https://arxiv.org/abs/2609.13509 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T00:16:48.850Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).