Publication View

Computing Simplicial Homology Based on (2002)

Abstract
We recall that the calculation of homology with integer coecients of a simplicial complex reduces to the calculation of the Smith Normal Form of the boundary matrices which in general are sparse. We provide a review of several algorithms for the calculation of Smith Normal Form of sparse matrices and compare their running times for actual boundary matrices. Then we describe alternative approaches to the calculation of simplicial homology. The last section then describes motivating examples and actual experiments with the GAP package that was implemented by the authors. These examples also include as an example of other homology theories some calculations of Lie algebra homology.

Publication details
Download http://citeseer.ist.psu.edu/611740.html
Source http://www.mathematik.uni-marburg.de/~welker/sections/../preprints/DHSW.ps
Publisher unknown
Contributors The Pennsylvania State University CiteSeer Archives
Repository CiteSeer (United States)
Keywords Ecient Smith,Normal Form Algorithms,Frank Heckenbach,David Saunders,Volkmar Welker Computing Simplicial Homology Based on
Language Englisch
Relation oai:CiteSeerPSU:475203, oai:CiteSeerPSU:174823, oai:CiteSeerPSU:570521, oai:CiteSeerPSU:144968