形状良好的单纯复形的高效 $1$-Laplacian 求解器:超越 Betti 数与坍缩序列
Efficient $1$-Laplacian Solvers for Well-Shaped Simplicial Complexes: Beyond Betti Numbers and Collapsing Sequences
AI总结:
本文提出了高精度近似求解形状良好单纯复形 $1$-Laplacian 线性方程组的高效算法,将专用求解器推广至无坍缩序列和有界 Betti 数的几何结构,并改进了 Nested Dissection 运行时间。
摘要:
我们提出了高效算法,可高精度近似求解形状良好的单纯复形的 $1$-Laplacian 线性方程组。$1$-Laplacian(即高维 Laplacian)将图 Laplacian 推广到高维单纯复形,在计算拓扑和拓扑数据分析中起关键作用。此前,针对已知坍缩序列且有界 Betti 数的单纯复形(如三角剖分 $\mathbb{R}^3$ 中三维球的复形),已有近线性时间近似求解器(Cohen 等人 [SODA'2014],Black 等人 [SODA'2022],Black 和 Nayyeri [ICALP'2022])。此外,Nested Dissection 为非零结构表示嵌入在 $\mathbb{R}^3$ 中形状良好的单纯复形的更一般系统提供了二次时间精确求解器。我们将 $1$-Laplacian 的专用求解器推广到具有额外几何结构但没有坍缩序列和有界 Betti 数的单纯复形,并改进了 Nested Dissection 的运行时间。我们关注满足两个条件的单纯复形:(1) 每个单纯形具有有界纵横比,(2) 它们可被划分为内部和边界形状良好的“不相交”平衡区域。我们的求解器从形状良好桁架刚度矩阵的 Incomplete Nested Dissection(Kyng 等人 [STOC'2018])中汲取了灵感。
英文摘要:
We present efficient algorithms for approximately solving systems of linear equations in $1$-Laplacians of well-shaped simplicial complexes up to high precision. $1$-Laplacians, or higher-dimensional Laplacians, generalize graph Laplacians to higher-dimensional simplicial complexes and play a key role in computational topology and topological data analysis. Previously, nearly-linear time approximate solvers were developed for simplicial complexes with known collapsing sequences and bounded Betti numbers, such as those triangulating a three-ball in $\mathbb{R}^3$ (Cohen, Fasy, Miller, Nayyeri, Peng, and Walkington [SODA'2014], Black, Maxwell, Nayyeri, and Winkelman [SODA'2022], Black and Nayyeri [ICALP'2022]). Furthermore, Nested Dissection provides quadratic time exact solvers for more general systems with nonzero structures representing well-shaped simplicial complexes embedded in $\mathbb{R}^3$. We generalize the specialized solvers for $1$-Laplacians to simplicial complexes with additional geometric structures but without collapsing sequences and bounded Betti numbers, and we improve the runtime of Nested Dissection. We focus on simplicial complexes that meet two conditions: (1) each individual simplex has a bounded aspect ratio, and (2) they can be divided into "disjoint" and balanced regions with well-shaped interiors and boundaries. Our solvers draw inspiration from the Incomplete Nested Dissection for stiffness matrices of well-shaped trusses (Kyng, Peng, Schwieterman, and Zhang [STOC'2018]).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。