# A novel technique for cohomology computations in engineering practice

@article{Dlotko2013ANT, title={A novel technique for cohomology computations in engineering practice}, author={Pawel Dlotko and Ruben Specogna}, journal={Computer Methods in Applied Mechanics and Engineering}, year={2013}, volume={253}, pages={530-542} }

## Figures and Tables from this paper

## 10 Citations

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

- MathematicsIEEE 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.

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

- MathematicsComput. Phys. Commun.
- 2013

Optimal Cohomology Generators for 2-D Eddy-Current Problems in Linear Time

- MathematicsIEEE Transactions on Magnetics
- 2013

An automatic and efficient algorithm to find cohomology generators suitable for 2-D eddy-current problems formulated by means of complementary formulations that produces optimal representatives of generators.

Lean Cohomology Computation for Electromagnetic Modeling

- MathematicsIEEE 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.

Topoprocessor: An Efficient Computational Topology Toolbox for h-Oriented Eddy Current Formulations

- MathematicsIEEE Transactions on Magnetics
- 2017

This paper introduces an upgrade in the Dłotko–Specogna (DS) algorithm that speeds up the execution for very complicated geometries, and provides a detailed comparison of computational resources needed for the topological pre-processing by the toolbox and the tool to compute a standard cohomology basis available in the mesh generator GMSH.

Construction of a Finite Element Basis of the First de Rham Cohomology Group and Numerical Solution of 3D Magnetostatic Problems

- MathematicsSIAM J. Numer. Anal.
- 2013

An efficient algorithm for the finite element approximation of harmonic fields and the numerical solution of three-dimensional magnetostatic problems is devised and a finite element basis of the first de Rham cohomology group of the computational domain is constructed.

Tree-Cotree Decomposition of Isogeometric Mortared Spaces in H(curl) on Multi-Patch Domains

- Computer ScienceComputer Methods in Applied Mechanics and Engineering
- 2022

Compatible discrete operator schemes on polyhedral meshes for elliptic and Stokes equations

- Computer Science, Mathematics
- 2014

This thesis presents a new class of spatial discretization schemes on polyhedral meshes, called Compatible Discrete Operator (CDO) schemes and their application to elliptic and Stokes equations. In…

Robust full-wave Maxwell solver in time-domain using magnetic vector potential with edge elements

- Physics
- 2017

Magnetic vector potential (MVP) formulations are widely used in low-frequency eddy-current computation. For full-wave Maxwell problems with coupled resistive, inductive and capacitive effects,…

## References

SHOWING 1-10 OF 55 REFERENCES

Efficient Cohomology Computation for Electromagnetic Modeling

- Computer Science
- 2010

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 electromagnetic modeling

- Mathematics
- 2011

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…

Computational Topology - an Introduction

- Computer Science
- 2009

This book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles.

Toward an algorithm to make cuts for magnetic scalar potentials in finite element meshes

- Computer Science
- 1988

Sufficiency conditions for the intersection of different cuts show that when several cuts are required it may not be possible to avoid intersections, which clarifies the question of what data must necessarily be given in order for an algorithm to work.

Efficient generalized source field computation for h-oriented magnetostatic formulations

- Computer Science
- 2011

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.

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…

Optimal discrete Morse functions for 2-manifolds

- Computer Science, MathematicsComput. Geom.
- 2003

An algorithm to construct the discrete cohomology basis functions required for magnetic scalar potential formulations without cuts

- Mathematics
- 2002

Magnetic scalar potential formulations without cuts require the definition of a set of basis functions for the cohomology structure of the magnetic field function space. This paper presents an…

Stable, circulation-preserving, simplicial fluids

- Computer ScienceTOGS
- 2007

This article proposes a novel technique for the simulation of fluid flows designed to respect the defining differential properties, that is, the conservation of circulation along arbitrary loops as they are transported by the flow.

Critical Analysis of the Spanning Tree Techniques

- Computer ScienceSIAM J. Numer. Anal.
- 2010

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.