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

U-匹配因子分解:稀疏同调代数,惰性圈代表,持久(余)同调中的对偶

U-match factorization: sparse homological algebra, lazy cycle representatives, and dualities in persistent (co)homology

Haibin Hang, Chad Giusti, Lori Ziegelmeier, Gregory Henselman-Petrusek

摘要:

持久同源性是拓扑数据分析的重要工具。TDA中的许多问题都可以通过同调--实际上是线性代数来解决。然而,这个域中的矩阵通常很大,行和列的数量都是数十亿。这种阵列的低秩近似通常会破坏基本信息;因此,对于非常大的稀疏矩阵,需要新的数学和计算范例。我们提出了U匹配矩阵分解方案来解决这一挑战。U-match有两个可取的特征。首先,它允许一种压缩存储格式,与其他常见的因式分解相比,它将计算机内存中的非零条目数量减少了一个或多个数量级。其次,它允许直接解决线性和同调代数中的各种问题,而不需要解压缩存储在内存中的矩阵。这些问题包括查找和检索的行和列;评价的出生/死亡时间,并提取发电机在持久(共)同源性;和,计算基地的过滤链复形的边界和循环子空间。这样的基础是解锁一系列其他拓扑技术用于TDA的关键,U匹配因子分解旨在使从业者广泛使用这样的计算。作为一个应用程序,我们表明,在持久的同源性的个人周期代表可以检索的时间和内存成本的数量级低于目前的最先进的,通过全球二元性。此外,实现这种计算所需的代数机器已经存在于许多现代求解器中。

英文摘要:

Persistent homology is a leading tool in topological data analysis (TDA). Many problems in TDA can be solved via homological -- and indeed, linear -- algebra. However, matrices in this domain are typically large, with rows and columns numbered in billions. Low-rank approximation of such arrays typically destroys essential information; thus, new mathematical and computational paradigms are needed for very large, sparse matrices. We present the U-match matrix factorization scheme to address this challenge. U-match has two desirable features. First, it admits a compressed storage format that reduces the number of nonzero entries held in computer memory by one or more orders of magnitude over other common factorizations. Second, it permits direct solution of diverse problems in linear and homological algebra, without decompressing matrices stored in memory. These problems include look-up and retrieval of rows and columns; evaluation of birth/death times, and extraction of generators in persistent (co)homology; and, calculation of bases for boundary and cycle subspaces of filtered chain complexes. Such bases are key to unlocking a range of other topological techniques for use in TDA, and U-match factorization is designed to make such calculations broadly accessible to practitioners. As an application, we show that individual cycle representatives in persistent homology can be retrieved at time and memory costs orders of magnitude below current state of the art, via global duality. Moreover, the algebraic machinery needed to achieve this computation already exists in many modern solvers.

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

↑