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

@article{Hang2021UmatchFS, 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}, journal={ArXiv}, year={2021}, volume={abs/2108.08831} }

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…

## One Citation

### The space of barcode bases for persistence modules

- Computer ScienceJournal of Applied and Computational Topology
- 2022

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.

## References

SHOWING 1-10 OF 68 REFERENCES

### Chain complex reduction via fast digraph traversal.

- Computer Science, Mathematics
- 2020

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

- Mathematics, Computer ScienceArXiv
- 2019

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

- Mathematics
- 2017

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…

### A spectral sequence for parallelized persistence

- MathematicsArXiv
- 2011

The resulting computational scheme suggests a parallelization scheme, and the communication steps involved in this scheme can also serve as a guideline for which parts of the boundary matrix manipulation need to co-exist in primary memory at any given time allowing for stratified memory access in single-core computation.

### Clear and Compress: Computing Persistent Homology in Chunks

- Computer ScienceTopological Methods in Data Analysis and Visualization
- 2014

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

- Computer Science, MathematicsSCG '09
- 2009

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

- Computer ScienceESA
- 2016

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

- Computer ScienceALENEX
- 2014

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 multiparameter persistent homology through a discrete Morse-based approach

- Computer ScienceComput. Geom.
- 2020

### Computing Topological Persistence for Simplicial Maps

- MathematicsSoCG
- 2014

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.