用于分层 Poincaré-Steklov 方法的两级直接求解器
A Two-Level Direct Solver for the Hierarchical Poincaré-Steklov Method
AI总结:
本文提出一种用于求解线性椭圆型 PDE 的 HPS 方法的两级直接求解器,通过批量 GPU 线性代数例程将问题简化为块稀疏系统,并利用选主元的稀疏直接求解器提升数值稳定性,实现高阶离散化的高效计算。
摘要:
我们引入了一种用于求解线性椭圆型 PDE 的分层 Poincaré-Steklov(HPS)方法的两级直接求解器。HPS 将多区域谱配置与直接求解器相结合,能够对高度振荡的解实现高阶离散化,同时保持计算效率。我们的方法采用批量线性代数例程并结合 GPU 加速,将问题简化至子域界面,从而生成一个块稀疏线性系统。随后,该系统使用一个采用选主元的稀疏直接求解器进行分解,以获得比原始 HPS 方案更好的数值稳定性。对于局部阶为 $p$ 且总自由度为 $N$ 的离散化,在三维情况下,初始归约步骤的渐近复杂度为 $O(N p^6)$。然而,批量 GPU 例程的高效性使得实际应用中的总成本与多项式阶数无关(对于阶数 $p=20$ 甚至更高)。此外,稀疏直接求解器的成本也与多项式阶数无关。我们介绍了该方法的描述与论证,并给出了三维问题的数值实验以评估其准确性和性能。
英文摘要:
We introduce a two-level direct solver for the Hierarchical Poincaré-Steklov (HPS) method for solving linear elliptic PDEs. HPS combines multidomain spectral collocation with a direct solver, enabling high-order discretizations for highly oscillatory solutions while preserving computational efficiency. Our method employs batched linear algebra routines with GPU acceleration to reduce the problem to subdomain interfaces, yielding a block-sparse linear system. This system is then factorized using a sparse direct solver that employs pivoting to achieve better numerical stability than the original HPS scheme. For a discretization of local order $p$ involving a total of $N$ degrees of freedom, the initial reduction step has asymptotic complexity $O(N p^6)$ in three dimensions. Nevertheless, the high efficiency of batched GPU routines makes the overall cost for practical purposes independent of polynomial order (for order $p=20$ or even higher). Additionally, the cost of the sparse direct solver is independent of the polynomial order. We present a description and justification of our method, along with numerical experiments on three-dimensional problems to evaluate its accuracy and performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。