边界元法的分布式$\mathcal{H}^2$ -矩阵
Distributed $\mathcal{H}^2$-matrices for boundary element methods
摘要:
边界积分方程的标准离散化技术,例如,Galerkin边界元方法导致需要快速和有效压缩技术的大的密集填充矩阵,如快速多极方法或分级矩阵。如果底层网格非常大,则在分布式计算机上运行相应的算法是有吸引力的,例如,因为分布式计算机通常是成本有效的并且提供高的累积存储器带宽。与紧密相关的粒子方法相比,分布式算法已经很好地建立,Galerkin离散化带来了挑战,因为基函数的支持影响矩阵的块结构,从而影响相应算法中的数据流。本文介绍了分布式$\mathcal{H}^2$ -矩阵,这是一类与快速多极子方法密切相关的分层矩阵,特别适合于分布式计算。虽然早期的努力需要全局树结构的$\mathcal{H}^2$矩阵存储在分布式系统的每个节点,新的方法只需要本地多级信息,可以通过一个简单的分布式算法,使我们能够扩展到显着更大的系统。实验表明,该方法可以有效地处理包含$130$万个三角形的超大型网格。
英文摘要:
Standard discretization techniques for boundary integral equations, e.g., the Galerkin boundary element method, lead to large densely populated matrices that require fast and efficient compression techniques like the fast multipole method or hierarchical matrices. If the underlying mesh is very large, running the corresponding algorithms on a distributed computer is attractive, e.g., since distributed computers frequently are cost-effective and offer a high accumulated memory bandwidth. Compared to the closely related particle methods, for which distributed algorithms are well-established, the Galerkin discretization poses a challenge, since the supports of the basis functions influence the block structure of the matrix and therefore the flow of data in the corresponding algorithms. This article introduces distributed $\mathcal{H}^2$-matrices, a class of hierarchical matrices that is closely related to fast multipole methods and particularly well-suited for distributed computing. While earlier efforts required the global tree structure of the $\mathcal{H}^2$-matrix to be stored in every node of the distributed system, the new approach needs only local multilevel information that can be obtained via a simple distributed algorithm, allowing us to scale to significantly larger systems. Experiments show that this approach can handle very large meshes with more than $130$ million triangles efficiently.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。