  Topological Data Analysis has grown in popularity in recent years as a way to
apply tools from algebraic topology to large data sets. One of the main tools
in topological data analysis is persistent homology. This paper uses
undergraduate linear algebra to provide explicit methods for, and examples of,
computing persistent (co)homology.
