An algorithm for calculating top-dimensional bounding chains.
PEERJ COMPUTER SCIENCE(2018)
摘要
We describe the Coefficient-Flow algorithm for calculating the bounding chain of an (n-1)-boundary on an n-manifold-like simplicial complex S. We prove its correctness and show that it has a computational time complexity of O(vertical bar S(n-1)vertical bar) (where S(n-1) is the set of (n-1)-faces of S). We estimate the big-O coefficient which depends on the dimension of S and the implementation. We present an implementation, experimentally evaluate the complexity of our algorithm, and compare its performance with that of solving the underlying linear system.
更多查看译文
关键词
Homology,Computational algebraic topology
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络