论文标题
用于计算旋转Bose-Einstein冷凝水的基态的二阶流量
Second-order flows for computing the ground states of rotating Bose-Einstein condensates
论文作者
论文摘要
本文中的二阶流量是指某些涉及二阶时间衍生物的人工进化微分方程,这些方程与被认为是一阶流的梯度流不同。这是一个受欢迎的话题,因为惯性动态的最新进展随着凸优化的阻尼而进行。从数学上讲,旋转的玻色子冷凝水(BEC)的基态可以建模为在归一化约束下具有角动量旋转项的毛pitaevskii能量功能的最小化器。我们引入了两种类型的二阶流,作为该约束非凸优化问题的能量最小化策略,以便接近基态。提出的人工动力学是随着耗散的新型二阶非线性双曲偏微分方程。讨论了几种数值离散方案,包括用于时间离散化的显式和半平整方法,并结合了空间离散化的傅立叶假谱方法。这些为我们提供了一系列有效,可靠的算法,用于计算旋转BEC的基态。特别是,新开发的算法结果优于基于梯度流的最新数值方法。与梯度流类型方法相比:采用明确的时间离散策略时,提出的方法允许更大的稳定时间步长尺寸;对于半无限制离散化,使用相同的步长,需要少量的迭代才能达到停止标准,并且每次步骤都会遇到几乎相同的计算复杂性。记录了丰富而详细的数值示例,以进行验证和比较。
Second-order flows in this paper refer to some artificial evolutionary differential equations involving second-order time derivatives distinguished from gradient flows which are considered to be first-order flows. This is a popular topic due to the recent advances of inertial dynamics with damping in convex optimization. Mathematically, the ground state of a rotating Bose-Einstein condensate (BEC) can be modeled as a minimizer of the Gross-Pitaevskii energy functional with angular momentum rotational term under the normalization constraint. We introduce two types of second-order flows as energy minimization strategies for this constrained non-convex optimization problem, in order to approach the ground state. The proposed artificial dynamics are novel second-order nonlinear hyperbolic partial differential equations with dissipation. Several numerical discretization schemes are discussed, including explicit and semi-implicit methods for temporal discretization, combined with a Fourier pseudospectral method for spatial discretization. These provide us a series of efficient and robust algorithms for computing the ground states of rotating BECs. Particularly, the newly developed algorithms turn out to be superior to the state-of-the-art numerical methods based on the gradient flow. In comparison with the gradient flow type approaches: When explicit temporal discretization strategies are adopted, the proposed methods allow for larger stable time step sizes; While for semi-implicit discretization, using the same step size, a much smaller number of iterations are needed for the proposed methods to reach the stopping criterion, and every time step encounters almost the same computational complexity. Rich and detailed numerical examples are documented for verification and comparison.