arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.00046cs.CGcs.MS
收藏

链复形的局部同余

Local congruence of chain complexes

Gianmaria DelMonte, Elia Onofri, Giorgio Scorzelli, Alberto Paoluzzi

摘要:

本文的目的是利用单元同余的等价关系将一组局部链复形转化为一个整体复形,从拓扑上解决浮点运算的数值不准确性。在计算由细胞复合体的集合生成的空间排列时,可以从独立且有效地计算每个单个输入2-细胞与其他细胞的交集开始。这些交叉点的拓扑结构被编码在一组(0-2)维链复合物中。利用0-、1-和2-胞腔(基本链)之间ε-同余的等价关系,对局部链进行归并.特别地,我们将作为局部上边界链的矩阵矩阵的块对角上边界矩阵[Δ_0]和[Δ_1]约化为表示同余拓扑的整体矩阵[δ_0]和[δ_1],即,通过对它们的列进行初等代数运算,求出所有0-,1-,2-胞元之间的同余关系。该算法使用SuiteSparse的Julia移植进行编码:GraphBLAS标准的GraphBLAS实现,旨在使用线性代数和稀疏矩阵有效地计算大型图上的算法[1,2]。

英文摘要:

The object of this paper is to transform a set of local chain complexes to a single global complex using an equivalence relation of congruence of cells, solving topologically the numerical inaccuracies of floating-point arithmetics. While computing the space arrangement generated by a collection of cellular complexes, one may start from independently and efficiently computing the intersection of each single input 2-cell with the others. The topology of these intersections is codified within a set of (0-2)-dimensional chain complexes. The target of this paper is to merge the local chains by using the equivalence relations of ε-congruence between 0-, 1-, and 2-cells (elementary chains). In particular, we reduce the block-diagonal coboundary matrices [Δ_0] and [Δ_1], used as matrix accumulators of the local coboundary chains, to the global matrices [δ_0] and [δ_1], representative of congruence topology, i.e., of congruence quotients between all 0-,1-,2-cells, via elementary algebraic operations on their columns. This algorithm is codified using the Julia porting of the SuiteSparse:GraphBLAS implementation of the GraphBLAS standard, conceived to efficiently compute algorithms on large graphs using linear algebra and sparse matrices [1, 2].

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

↑