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

双调和问题的张量积顶点块光滑器

Tensor-product vertex patch smoothers for biharmonic problems

Julius Witte, Cu Cui, Francesca Bonizzoni, Guido Kanschat

AI总结:

本文提出将顶点块光滑器用于双调和问题,结合低秩张量近似,实验证明其高效收敛,且混合精度可提升吞吐量70%。

摘要:

我们讨论了将顶点块光滑器作为四阶椭圆偏微分方程的重叠区域分解方法。我们表明,它们在数值上非常高效,并产生高收敛率。此外,我们讨论了用于其高效实现的低秩张量近似。我们的实验表明,非精确局部求解器产生的方法在网格细化方面收敛快速且均匀。乘法光滑器在求解效率方面表现出优越性能,需要更少的迭代次数。然而,在三维情况下,加法光滑器优于其乘法对应物,因为后者并行化潜力较低。此外,求解器基础设施支持混合精度方法,以单精度执行多重网格预条件器,而以双精度执行外部迭代,从而将吞吐量提高多达70%。

英文摘要:

We discuss vertex patch smoothers as overlapping domain decomposition methods for fourth order elliptic partial differential equations. We show that they are numerically very efficient and yield high convergence rates. Furthermore, we discuss low rank tensor approximations for their efficient implementation. Our experiments demonstrate that the inexact local solver yields a method which converges fast and uniformly with respect to mesh refinement. The multiplicative smoother shows superior performance in terms of solution efficiency, requiring fewer iterations. However, in three-dimensional cases, the additive smoother outperforms its multiplicative counterpart due to the latter's lower potential for parallelism. Additionally, the solver infrastructure supports a mixed-precision approach, executing the multigrid preconditioner in single precision while performing the outer iteration in double precision, thereby increasing throughput by up to 70 percent.

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

↑