期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
A Global Reduction Based Algorithm for Computing Homology of Chain Complexes
1
作者 Madjid Allili david corriveau 《Advances in Pure Mathematics》 2016年第3期113-137,共25页
In this paper, we propose a new algorithm to compute the homology of a finitely generated chain complex. Our method is based on grouping several reductions into structures that can be encoded as directed acyclic graph... In this paper, we propose a new algorithm to compute the homology of a finitely generated chain complex. Our method is based on grouping several reductions into structures that can be encoded as directed acyclic graphs. The organized reduction pairs lead to sequences of projection maps that reduce the number of generators while preserving the homology groups of the original chain complex. This sequencing of reduction pairs allows updating the boundary information in a single step for a whole set of reductions, which shows impressive gains in computational performance compared to existing methods. In addition, our method gives the homology generators for a small additional cost. 展开更多
关键词 Homology Algorithm Chain Complex Homology Generators
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部