arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2412.02425math.NAcs.NAmath.OC
收藏

ParaOpt预条件子的高效并行反演

Efficient parallel inversion of ParaOpt preconditioners

Corentin Bonte, Arne Bouillon, Giovanni Samaey, Karl Meerbergen

AI总结:

针对ParaOpt算法拟牛顿步需迭代求解匹配条件系统的问题,将线性问题的并行预条件子推广到非线性情况,并提出新的快速反演方法,解决当前方法生成的独立小系统难求解的问题。

摘要:

最近,ParaOpt算法被提出,作为时间并行Parareal方法在最优控制中的扩展。ParaOpt使用拟牛顿步,每一步都需要迭代求解匹配条件系统。线性问题的最先进并行预条件子会生成一组独立的较小系统,目前难以求解。我们将该预条件子推广到非线性情况,并为这些较小系统提出一种新的快速反演方法,通过调整子问题的边界条件来避免当前选项的缺点。

英文摘要:

Recently, the ParaOpt algorithm was proposed as an extension of the time-parallel Parareal method to optimal control. ParaOpt uses quasi-Newton steps that each require solving a system of matching conditions iteratively. The state-of-the-art parallel preconditioner for linear problems leads to a set of independent smaller systems that are currently hard to solve. We generalize the preconditioner to the nonlinear case and propose a new, fast inversion method for these smaller systems, avoiding disadvantages of the current options with adjusted boundary conditions in the subproblems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑