Our implementation of the Smith Normal Form algorithm.
-
Updated
Aug 22, 2020 - Python
#
smith-normal-form
Here are 4 public repositories matching this topic...
Topological Data Analysis using cubical homology. Implements algorithms from Tomasz Kaczynski's Computational Homology. Utilizes the open-source exact linear algebra library LinBox for Smith normal form computations. Uses these TDA methods to compute the cubical homology of grids obtained from cellular automata.
game-of-life cellular-automata topological-data-analysis homology-computation smith-normal-form cubical-complexes
-
Updated
Apr 6, 2025 - C++
ANUBiS is a C++ library of high-performance algorithms for computing topological invariants of point sets and simplicial topological spaces.
topology topological-data-structures simplicial-complexes topological-data-analysis homology homology-computation homology-calculations smith-normal-form
-
Updated
Mar 21, 2021 - C++
Some linear algebra work done in Haskell
-
Updated
Feb 8, 2019 - Haskell
Improve this page
Add a description, image, and links to the smith-normal-form topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the smith-normal-form topic, visit your repo's landing page and select "manage topics."