Efficient Computation

Monday, August 13, 2018 - 4:00pm - 5:00pm
Gregory Henselman (University of Pennsylvania)
This talk will introduce the central ideas of discrete Morse theory in high-performance (persistent) homology computation. Historically rooted in deep and beautiful structures from smooth geometry, this theory may be viewed, from a computational standpoint, as a very direct means of organizing cellular data to improve efficiency. Time permitting, we will discuss how the method of homological Morse reduction may be extended to the calculation of barcodes.
Subscribe to RSS - Efficient Computation