Lazy cohomology generators: a breakthrough in (co)homology computations for CEM

Computing the first cohomology group generators received great attention in computational electromagnetics as a theoretically sound and safe method to produce cuts required when eddy-current problems are solved with the magnetic scalar potential formulations. This paper exploits the novel concept of lazy cohomology generators and a fast and general algorithm to compute them. This graph-theoretic algorithm is much faster than all competing ones being the typical computational time in the order of seconds even with meshes formed by millions of elements. Moreover, this paper introduces the use of minimal boundary generators to ease human-based basis selection and to obtain representatives of generators with compact support. We are persuaded that this is the definitive solution to this long-standing problem.