论文标题
HPC紧凑型准Newton算法用于接口问题
HPC compact quasi-Newton algorithm for interface problems
论文作者
论文摘要
在这项工作中，我们提出了一种可强大的接口耦合算法，称为紧凑型接口Quasi-Newton（CIQN）。它是为使用MPI多代码分区方案而设计的。该算法允许从以前的时间步骤中重复使用信息，这些功能先前提出以加速收敛。通过代数操作，通过以下方式实现了计算资源的有效用法：避免构造密集的矩阵并将每次乘法减少到矩阵向量产品并重复使用计算昂贵的循环。这导致了原始的准Newton算法的紧凑版本。通过有效的沟通，在本文中，我们显示了高达4800个内核的有效可伸缩性。证明具有定性不同动力学的三个示例证明该算法可以有效地处理增加的质量不稳定性和两场耦合问题。我们还展示了重复使用历史和过滤的方式，并不一定会制造出更强大的方案，最后，我们证明了该算法的HPC版本的必要性。本文的新颖性在于HPC的集中算法实现，详细介绍了如何融合和结合构图块以获得可扩展的MPI实现。在大规模案例中，这种实现是必须的，而与域的大小相比，接触表面不能存储在单个计算节点中，或者接触节点的数量不可忽略。 \ c {opyright} <2020> Elsevier。该手稿版本可根据CC-BY-NC-ND 4.0许可证http://creativecommons.org/licenses/by-nc-nd/4.0/提供。
In this work we present a robust interface coupling algorithm called Compact Interface quasi-Newton (CIQN). It is designed for computationally intensive applications using an MPI multi-code partitioned scheme. The algorithm allows to reuse information from previous time steps, feature that has been previously proposed to accelerate convergence. Through algebraic manipulation, an efficient usage of the computational resources is achieved by: avoiding construction of dense matrices and reduce every multiplication to a matrix-vector product and reusing the computationally expensive loops. This leads to a compact version of the original quasi-Newton algorithm. Altogether with an efficient communication, in this paper we show an efficient scalability up to 4800 cores. Three examples with qualitatively different dynamics are shown to prove that the algorithm can efficiently deal with added mass instability and two-field coupled problems. We also show how reusing histories and filtering does not necessarily makes a more robust scheme and, finally, we prove the necessity of this HPC version of the algorithm. The novelty of this article lies in the HPC focused implementation of the algorithm, detailing how to fuse and combine the composing blocks to obtain an scalable MPI implementation. Such an implementation is mandatory in large scale cases, for which the contact surface cannot be stored in a single computational node, or the number of contact nodes is not negligible compared with the size of the domain. \c{opyright} <2020> Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
