• Corpus ID: 15697801

Physics inspired algorithms for (co)homology computation

  title={Physics inspired algorithms for (co)homology computation},
  author={Pawel Dlotko and Ruben Specogna},
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… 

Figures and Tables from this paper

Lazy Cohomology Generators: A Breakthrough in (Co)homology Computations for CEM
This paper exploits the novel concept of lazy cohomology generators and a fast and general algorithm to compute them and introduces the use of minimal boundary generators to ease human-based basis selection and to obtain representatives of generators with compact support.
Fast halo currents computation in fusion reactors by electrokinetic complementary formulations
A novel algorithm is presented to generate the absolute second Cohomology group generators exploiting the idea of lazy cohomology generators stored as sparse vectors to save orders of magnitude computational time.


Cohomology in electromagnetic modeling
Electromagnetic modeling provides an interesting context to present a link between physical phenomena and homology and cohomology theories. Over the past twenty-five years, a considerable effort has
Efficient Cohomology Computation for Electromagnetic Modeling
An automatic, computationally efficient and provably general algorithm based on a rigorous algorithm to compute a cohomology basis of the insulating region with state-of-art reductions techniquesexpressly designed for cohomological computations over simplicial complexes is presented.
Cohomology in 3D Magneto-Quasistatics Modeling
Several definitions of cuts are surveyed, defined as generators of the first cohomology group over integers of a finite CW-complex, which has the virtue of providing an automatic, general and efficient algorithm for the computation of cuts.
Greedy optimal homotopy and homology generators
It is shown that the shortest set of loops that generate the fundamental group of any oriented combinatorial 2-manifold, with any given basepoint, can be constructed in O(n log n) time using a straightforward application of Dijkstra's shortest path algorithm.
Extensive scaling from computational homology and Karhunen-Loève decomposition analysis of Rayleigh-Bénard convection experiments.
Spatiotemporally chaotic dynamics in laboratory experiments on convection are characterized using a new dimension, D(CH), determined from computational homology, which scales in the same manner as D(KLD), a dimension determined from experimental data using Karhuenen-Loéve decomposition.
Critical Analysis of the Spanning Tree Techniques
The aim of this paper is to give a rigorous description of the GSTT in terms of homology and cohomology theories, together with an analysis of its termination.
A basic course in algebraic topology
1: Two-Dimensional Manifolds. 2: The Fundamental Group. 3: Free Groups and Free Products of Groups. 4: Seifert and Van Kampen Theorem on the Fundamental Group of the Union of Two Spaces.
Efficient generalized source field computation for h-oriented magnetostatic formulations
The aim of this paper is to present a generalization of STT called Extended Spanning Tree Technique (ESTT), which is provably general and it retains the STT computational efficiency.