基于强可接受性的递归骨架化分解
A recursive skeletonization factorization based on strong admissibility
AI总结:
本文提出基于递归骨架化的强递归骨架化分解方法,用于求解二维、三维椭圆偏微分方程的离散化线性积分方程,通过压缩远场交互实现低秩增长的近似分解。
摘要:
我们引入了基于递归骨架化的强递归骨架化分解(RS-S),一种基于递归骨架化的新型近似矩阵分解方法,用于求解与二维和三维椭圆偏微分方程相关的线性积分方程的离散化问题(以及其他具有类似层次秩结构的矩阵)。与之前的骨架化分解方法不同,RS-S使用了骨架化的简单修改,即强骨架化,仅压缩远场交互。这导致了以许多块单位上三角矩阵的乘积形式的近似分解,可用于作为预条件子或中等精度的直接求解器。我们进一步将强骨架化过程与交替近场压缩结合,得到混合递归骨架化分解(RS-WS),这是RS-S的一种修改版本,在许多情况下表现出减少的存储成本。在合适的秩假设下,RS-S和RS-WS均表现出线性计算复杂性,我们通过一系列数值示例进行了验证。
英文摘要:
We introduce the strong recursive skeletonization factorization (RS-S), a new approximate matrix factorization based on recursive skeletonization for solving discretizations of linear integral equations associated with elliptic partial differential equations in two and three dimensions (and other matrices with similar hierarchical rank structure). Unlike previous skeletonization-based factorizations, RS-S uses a simple modification of skeletonization, strong skeletonization, which compresses only far-field interactions. This leads to an approximate factorization in the form of a product of many block unit-triangular matrices that may be used as a preconditioner or moderate-accuracy direct solver, with dramatically reduced rank growth. We further combine the strong skeletonization procedure with alternating near-field compression to obtain the hybrid recursive skeletonization factorization (RS-WS), a modification of RS-S that exhibits reduced storage cost in many settings. Under suitable rank assumptions both RS-S and RS-WS exhibit linear computational complexity, which we demonstrate with a number of numerical examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。