Coreduction homology algorithm for inclusions and persistent homology
From MaRDI portal
Publication:630667
DOI10.1016/j.camwa.2010.09.036zbMath1207.57001OpenAlexW2039502051MaRDI QIDQ630667
Publication date: 19 March 2011
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.09.036
Analysis of microstructure in solids (74N15) Topological manifolds (57N99) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04)
Related Items
Efficient Computation of Persistent Homology for Cubical Data ⋮ Allowing cycles in discrete Morse theory ⋮ Morse theory for filtrations and efficient computation of persistent homology ⋮ The cubical cohomology ring: an algorithmic approach ⋮ Discrete Morse theoretic algorithms for computing homology of complexes and maps ⋮ Homological Shape Analysis Through Discrete Morse Theory ⋮ Coreduction homology algorithm for regular CW-complexes ⋮ Computing multiparameter persistent homology through a discrete Morse-based approach ⋮ Rigorous cubical approximation and persistent homology of continuous functions ⋮ Topological microstructure analysis using persistence landscapes ⋮ Distributed computation of coverage in sensor networks by homological methods ⋮ Simplicial Models and Topological Inference in Biological Systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On efficient sparse integer matrix Smith normal form computations
- Čech type approach to computing homology of maps
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- Index pairs algorithms
- Homology algorithm based on acyclic subspace
- Coreduction homology algorithm
- Extending persistence using Poincaré and Lefschetz duality
- Homology computation by reduction of chain complexes
- On the use of size functions for shape analysis
- Computational homology
- Computing persistent homology
- Topological persistence and simplification
- Graph approach to the computation of the homology of continuous maps
- New methods for reducing size graphs
- The viscous Cahn-Hilliard equation. I. Computations
- Barcodes: The persistent topology of data
- Size functions and formal series
- Size functions from a categorical viewpoint
