arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.08333math.NAcs.NA
收藏

一种自适应并行算法

An Adaptive Parareal Algorithm

Y. Maday, O. Mula

摘要:

本文研究了利用时域分解加速不定常问题的数值模拟的问题。现有的算法,使这种分解存在严重的效率限制,是一个障碍,为解决大规模和高维问题。我们的主要贡献是提高并行效率的parareal在时间的方法。平行面方法基于将由数值上廉价的求解器(具有粗糙的物理和/或粗糙的分辨率)做出的预测与来自昂贵的求解器(具有高保真的物理和高分辨率)的校正相结合。在收敛时,该算法提供了具有精细求解器的高保真物理和高分辨率的解决方案。在经典版本中,精细求解器具有固定的高精度,这是实现具有竞争力的并行效率的主要障碍。在本文中,我们开发了一个自适应的变种,克服了这个障碍,通过动态提高精度的精细求解器跨parareal迭代。我们从理论上表明,并行效率变得非常有竞争力的理想情况下,粗解算器的成本很小,从而证明,唯一剩下的因素阻碍充分的可扩展性成为成本的粗解算器和通信时间。开发的理论也有优点,设置一个通用的框架,以了解成功的几个扩展parareal的基础上,迭代提高质量的精细求解器和重新使用信息从以前的parareal步骤。我们说明了刚性常微分方程,这是一个具有挑战性的问题,因为唯一的自适应机制是时间和效率的粗求解器的成本的影响的方法的实际性能。

英文摘要:

In this paper, we consider the problem of accelerating the numerical simulation of time dependent problems by time domain decomposition. The available algorithms enabling such decompositions present severe efficiency limitations and are an obstacle for the solution of large scale and high dimensional problems. Our main contribution is the improvement of the parallel efficiency of the parareal in time method. The parareal method is based on combining predictions made by a numerically inexpensive solver (with coarse physics and/or coarse resolution) with corrections coming from an expensive solver (with high-fidelity physics and high resolution). At convergence, the algorithm provides a solution that has the fine solver's high-fidelity physics and high resolution. In the classical version, the fine solver has a fixed high accuracy which is the major obstacle to achieve a competitive parallel efficiency. In this paper, we develop an adaptive variant that overcomes this obstacle by dynamically increasing the accuracy of the fine solver across the parareal iterations. We theoretically show that the parallel efficiency becomes very competitive in the ideal case where the cost of the coarse solver is small, thus proving that the only remaining factors impeding full scalability become the cost of the coarse solver and communication time. The developed theory has also the merit of setting a general framework to understand the success of several extensions of parareal based on iteratively improving the quality of the fine solver and re-using information from previous parareal steps. We illustrate the actual performance of the method in stiff ODEs, which are a challenging family of problems since the only mechanism for adaptivity is time and efficiency is affected by the cost of the coarse solver.

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

↑