Computation of Persistent Homology, Part I

In the first lecture on Computation of Persistent Homology, we will discuss the matrix reduction algorithm for computing persistent homology of a simplexwise filtration. This algorithm yields a constructive proof of the existence of an essentially unique decomposition of a persistence module into interval summands, described by the persistence barcode.