We extend the tensor-product direct solver from the Laplacian to the Schrödinger operator . When the potential is separable, the operator is inverted or exponentiated at cost in dimensions via per-axis eigendecomposition. On a single NVIDIA A100 GPU, this costs less than one second for degrees of freedom in 3D. For non-separable potentials , the same solver provides a preconditioner for the preconditioned conjugate gradient (PCG) method and a propagator for operator-splitting time integrators. For bounded , we prove that the preconditioned operator has a bounded condition number and a clustered spectrum with at most finitely many outlier eigenvalues, independently of the mesh size, and also independently of the domain size when is a confining potential. This explains the mesh- and domain-independent PCG iteration counts observed in practice. We apply this method to ground state computation via inverse iteration for linear problems and via the gradient flow for Gross–Pitaevskii energy in 3D, and also Hamiltonian simulation via the approximated qHOP and Magnus-2 splitting methods from 3D to 9D on a single NVIDIA GH200 GPU.

生成讲解博客的中文版本

生成AI智能校验的中文版本