• Corpus ID: 237213570

U-match factorization: sparse homological algebra, lazy cycle representatives, and dualities in persistent (co)homology

  title={U-match factorization: sparse homological algebra, lazy cycle representatives, and dualities in persistent (co)homology},
  author={Haibin Hang and Chad Giusti and Lori Ziegelmeier and Gregory Henselman-Petrusek},
Persistent homology is a leading tool in topological data analysis (TDA). Many problems in TDA can be solved via homological – and indeed, linear – algebra. However, matrices in this domain are typically large, with rows and columns numbered in billions. Low-rank approximation of such arrays typically destroys essential information; thus, new mathematical and computational paradigms are needed for very large, sparse matrices. We present the U-match matrix factorization scheme to address this… 
1 Citations

Tables from this paper

The space of barcode bases for persistence modules

A new algorithm for computing barcodes which also keeps track of, and outputs, such a change of basis and an explicit characterisation of the group of transformations that sends one barcode basis to another.



Chain complex reduction via fast digraph traversal.

A new algorithm for reducing a chain complex using algebraic Morse theory and it outperforms built-in algorithms in other CASs, and a family of Morse matchings on any chain complex of free modules of finite rank is discovered.

Persistent and Zigzag Homology: A Matrix Factorization Viewpoint

This paper shows how to use arbitrary induced maps on homology for computation, providing a framework that goes beyond the capabilities of existing software for topological data analysis and offers multiple opportunities for parallelization which have not been previously explored.

Matroids and Canonical Forms: Theory and Applications

This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure

Clear and Compress: Computing Persistent Homology in Chunks

This work presents a parallel algorithm for computing the persistent homology of a filtered chain complex by first computing persistence pairs within local chunks, then simplifying the unpaired columns, and finally applying standard reduction on the simplified matrix.

Persistent Cohomology and Circular Coordinates

This work develops a machinery of persistent cohomology to identify candidates for significant circle-structures in the data and uses harmonic smoothing and integration to obtain the circle-valued coordinate functions themselves, and suggests that this enriched class of coordinate functions permits a precise NLDR analysis of a broader range of realistic data sets.

SimBa: An Efficient Tool for Approximating Rips-Filtration Persistence via Simplicial Batch-Collapse

An efficient new algorithm is proposed, called SimBa, for approximating the persistent homology of Rips filtrations with quality guarantees, which leverages a batch collapse strategy as well as a new sparse Rips-like filtration.

Distributed Computation of Persistent Homology

It is demonstrated that a simple adaption of the standard reduction algorithm leads to a variant for distributed systems that at least compensates for the overhead caused by communication between nodes, and often even speeds up the computation compared to sequential and even parallel shared memory algorithms.

Computing Topological Persistence for Simplicial Maps

This paper proposes a practical algorithm for computing persistence under Z2 coefficients for a (monotone) sequence of general simplicial maps and shows how these maps arise naturally in some applications of topological data analysis.

Strong Collapse for Persistence

A fast and memory efficient approach to compute the persistent homology (PH) of a sequence of simplicial complexes by using strong collapses and an induced sequence of reduced simplified complexes that has the same PH as the initial one is introduced.