arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

保守Vlasov模拟中正交约束下的非负低秩矩阵校正

Nonnegative Low-Rank Matrix Correction under an Orthogonality Constraint in Conservative Vlasov Simulations

Yue Wu, Stephen Becker, Jingmei Qiu, Xiangxiong Zhang

arXiv 2607.26272首次发表:更新:

AI 中文总结

针对保守Vlasov模拟中SVD型截断引入负值的问题,提出凸、非凸两种低秩矩阵校正算法,其中切空间加速交替投影成本效率最高,可作为正性限制器用于Vlasov求解器。

AI 中文摘要

在Vlasov动力学的低秩数值方法中,SVD型截断过程可能会在数值解中引入负元素。这些负值不符合物理规律,因为该解是概率分布函数。我们设计基于优化的后处理算法,以在逐点保持宏观量(密度、动量和能量)的同时恢复非负性。宏观量的保持被表述为对校正项的正交约束。对于基于平方核范数最小化的凸公式,我们证明带有正交约束的近端算子由隐式奇异值阈值方程表征,且该阈值可通过二分法高效计算。基于此结果,我们为该凸公式开发了五种算法:Douglas–Rachford分裂、重启对偶FISTA、重启对偶加速梯度下降、对偶PR+共轭梯度和对偶L-BFGS。我们还考虑了带有显式秩约束的非凸公式,并开发了切空间加速交替投影算法,该算法每次迭代仅需进行一次\boldsymbol{2r \times 2r}的SVD。对朗道阻尼测试案例的数值结果表明,所提出的算法具有相当的校正质量。其中,切空间加速交替投影算法的成本效率最高,且随着问题规模增大,其效率优势愈发明显。我们进一步将该校正作为正性限制器应用于时变保守低秩Vlasov求解器中,该求解器可消除SVD型截断引入的负值,同时保持守恒的质量、动量和能量。

英文摘要

In low-rank numerical methods for Vlasov dynamics, the SVD-type truncation procedure may introduce negative entries into the numerical solution. Such negative values are unphysical because the solution is a probability distribution function. We design optimization-based post-processing algorithms to recover nonnegativity while preserving the macroscopic quantities (density, momentum, and energy) pointwise. The preservation of the macroscopic quantities is written as an orthogonality constraint on the correction term. For a convex formulation based on squared nuclear norm minimization, we show that the proximal operator with the orthogonality constraint is characterized by an implicit singular value thresholding equation, and the threshold can be computed efficiently by bisection. Based on this result, we develop five algorithms for the convex formulation: Douglas--Rachford splitting, restarted dual FISTA, restarted dual accelerated gradient descent, dual PR+ conjugate gradient, and dual L-BFGS. We also consider a non-convex formulation with an explicit rank constraint and develop a tangent-space accelerated alternating projection algorithm that only requires a \(2r \times 2r\) SVD per iteration. Numerical results for a Landau damping test case show that the proposed algorithms give comparable correction quality. Among them, the tangent-space accelerated alternating projection is the most cost-efficient, increasingly so as the problem size grows. We further demonstrate the correction as a positivity limiter inside a time-dependent conservative low-rank Vlasov solver, where it removes the negativity introduced by the SVD-type truncation while preserving the conserved mass, momentum, and energy.

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑