Physics inspired algorithms for (co)homology computation

arXiv1212.1360MaRDI QIDQ6237792FDOQ6237792

Authors: Paweł Dłotko, Ruben Specogna 

Publication date: 6 December 2012

Abstract: The issue of computing (co)homology generators of a cell complex is gaining a pivotal role in various branches of science. While this issue can be rigorously solved in polynomial time, it is still overly demanding for large scale problems. Drawing inspiration from low-frequency electrodynamics, this paper presents a physics inspired algorithm for first cohomology group computations on three-dimensional complexes. The algorithm is general and exhibits orders of magnitude speed up with respect to competing ones, allowing to handle problems not addressable before. In particular, when generators are employed in the physical modeling of magneto-quasistatic problems, this algorithm solves one of the most long-lasting problems in low-frequency computational electromagnetics. In this case, the effectiveness of the algorithm and its ease of implementation may be even improved by introducing the novel concept of extit{lazy cohomology generators}.

This page was built for publication: Physics inspired algorithms for (co)homology computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6237792)