CAPD::RedHom - Reduction heuristics for homology algorithms
We present an efficient software package for computing homology of sets, maps and filtrations represented as cubical, simplicial and regular CW complexes. The core homology computation is based on classical Smith diagonalization, but the efficiency of our approach comes from applying several geometr...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/26553 |
| Acceso en línea: | http://hdl.handle.net/11441/26553 |
| Access Level: | acceso abierto |
| Palabra clave: | Homology software Homology algorithms Betti numbers Homology groups Homology generators Homology maps Cubical sets Simplicial complexes CW complexes |
| Sumario: | We present an efficient software package for computing homology of sets, maps and filtrations represented as cubical, simplicial and regular CW complexes. The core homology computation is based on classical Smith diagonalization, but the efficiency of our approach comes from applying several geometric and algebraic reduction techniques combined with smart implementation. |
|---|