paper

Generators of with for Triangulated Surfaces : Construction and Classification of Global Loops

arXiv:2504.05124

Abstract

Given a compact surface embedded in with boundary , our goal is to construct a set of representatives for a basis of the relative cohomology group , where is a specified subset of . To achieve this, we propose a novel graph-based algorithm with two key features: it is applicable to non-orientable surfaces, thereby generalizing the construction of Hiptmair and Ostrowski [SIAM J. Comput., 31 (2002)], and it has a worst-case time complexity that is linear in the number of edges of the mesh triangulating . Importantly, this algorithm serves as a critical pre-processing step to address the low-frequency breakdown encountered in boundary element discretizations of integral equation formulations.