Author
Harker, S
Mischaikow, K
Mrozek, M
Nanda, V
Journal title
Foundations of Computational Mathematics
DOI
10.1007/s10208-013-9145-0
Issue
1
Volume
14
Last updated
2024-02-17T12:38:45.453+00:00
Page
151-184
Abstract
We provide explicit and efficient reduction algorithms based on discrete Morse theory to simplify homology computation for a very general class of complexes. A set-valued map of top-dimensional cells between such complexes is a natural discrete approximation of an underlying (and possibly unknown) continuous function, especially when the evaluation of that function is subject to measurement errors. We introduce a new Morse theoretic preprocessing framework for deriving chain maps from such set-valued maps, and hence provide an effective scheme for computing the morphism induced on homology by the approximated continuous function.
Symplectic ID
673276
Favourite
Off
Publication type
Journal Article
Publication date
14 Feb 2013
Please contact us with feedback and comments about this page. Created on 27 Jan 2017 - 13:43.