# Physics inspired algorithms for (co)homology computations of three-dimensional combinatorial manifolds with boundary

@article{Dlotko2013PhysicsIA, title={Physics inspired algorithms for (co)homology computations of three-dimensional combinatorial manifolds with boundary}, author={Pawel Dlotko and Ruben Specogna}, journal={Comput. Phys. Commun.}, year={2013}, volume={184}, pages={2257-2266} }

## Figures, Tables, and Topics from this paper

## 32 Citations

Lazy Cohomology Generators: A Breakthrough in (Co)homology Computations for CEM

- Computer ScienceIEEE Transactions on Magnetics
- 2014

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.

Computation of Relative 1-Cohomology Generators From a 1-Homology Basis for Eddy Currents Boundary Integral Formulations

- Computer ScienceIEEE Transactions on Magnetics
- 2016

This paper proposes to compute the relative cohomology generators from the homology generators, introducing a novel and general algorithm whose running time is again linear in the worst case.

Lean Cohomology Computation for Electromagnetic Modeling

- Computer ScienceIEEE Transactions on Magnetics
- 2018

Modifications to the Dłotko–Specogna algorithm are introduced to compute a regular basis of the first cohomology group in practically the same time as the generation of a lazy Cohomology basis.

Laplacians on flat line bundles over 3-manifolds

- Mathematics, Computer ScienceComput. Graph.
- 2013

This work investigates and visualize the two-dimensional zero sets of the first eigenfunctions of the modified Laplacians, yielding an approach for constructing characteristic well-behaving, particularly robust homology generators invariant under isometric deformation.

Fast Computation of Cuts With Reduced Support by Solving Maximum Circulation Problems

- Computer ScienceIEEE Transactions on Magnetics
- 2015

A technique to efficiently compute optimal cuts required to solve 3-D eddy current problems by magnetic scalar potential formulations is presented, based on a novel graph-theoretic algorithm to solve a maximum circulation network flow problem in unweighted graphs that typically runs in linear time.

Cyclic Symmetry in Volume Integral Formulations for Eddy Currents: Cohomology Computation and Gauging

- Computer ScienceIEEE Transactions on Magnetics
- 2020

In this article, an algorithm to compute a set of suitable cohomology generators needed when the conductors are not simply connected is introduced first and reuses a code that computes generators for triangular surface meshes, with obvious advantages concerning the implementation effort.

Lazy Cohomology Generators Enable the Use of Complementarity for Computing Halo Current Resistive Distribution in Fusion Reactors

- PhysicsIEEE Transactions on Magnetics
- 2014

This paper presents a methodology to efficiently calculate the resistive distribution of halo currents in 3-D conductive structures that surround the plasma in magnetic confinement fusion devices.…

Topology Preserving Thinning of Cell Complexes

- Computer Science, MedicineIEEE Transactions on Image Processing
- 2014

A novel topology preserving thinning algorithm is introduced, which removes simple cells-a generalization of simple points-of a given cell complex and enables, for the first time, to thin a general unstructured simplicial complex.

Inverting the discrete curl operator: a novel graph algorithm to find a vector potential of a given vector field

- Computer Science, MathematicsArXiv
- 2021

A new recursive algorithm to compute discrete vector potentials works directly on basis elements of 1and 2-chains by performing elementary Gaussian operations on them associated with acyclic matchings that can be applied recursively.

Optimized cycle basis in volume integral formulations for large scale eddy-current problems

- Computer ScienceComput. Phys. Commun.
- 2021

## References

SHOWING 1-10 OF 58 REFERENCES

Efficient Cohomology Computation for Electromagnetic Modeling

- Mathematics
- 2010

The systematic potential design is of high importance in computational electromagnetics. For example, it is well known that when the efficient eddycurrent formulations based on a magnetic scalar…

Cohomology in 3D Magneto-Quasistatics Modeling

- Computer Science
- 2013

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.

A fast algorithm to compute cohomology group generators of orientable 2-manifolds

- Mathematics, Computer SciencePattern Recognit. Lett.
- 2012

Hodge decompositions and computational electromagnetics

- Mathematics
- 1985

The handling of topological aspects in boundary value problems of engineering electromagnetics is often considered to be an engineer's art and not a science. This thesis is an attempt to show that…

Complementary geometric formulations for electrostatics

- Mathematics
- 2011

SUMMARY The simultaneous use of a pair of complementary discrete formulations for electrostatic boundary value problems (BVPs) allows to accurately compute electromagnetic quantities, such as…

Homology in Electromagnetic Boundary Value Problems

- Mathematics
- 2010

We discuss how homology computation can be exploited in computational electromagnetism. We represent various cellular mesh reduction techniques, which enable the computation of generators of homology…

Whitney forms: a class of finite elements for three-dimensional computations in electromagnetism

- Mathematics
- 1988

It has been recognised that numerical computations of magnetic fields by the finite-element method may require new types of elements, whose degrees of freedom are not field values at mesh nodes, but…

Greedy optimal homotopy and homology generators

- Mathematics, Computer ScienceSODA '05
- 2005

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.

On making cuts for magnetic scalar potentials in multiply connected regions

- Physics
- 1987

The problem of making cuts is of importance to scalar potential formulations of three‐dimensional eddy current problems. Its heuristic solution has been known for a century [J. C. Maxwell, A Treatise…