Lean Cohomology Computation for Electromagnetic Modeling

@article{Dlotko2018LeanCC,
  title={Lean Cohomology Computation for Electromagnetic Modeling},
  author={Pawel Dlotko and Bernard Kapidani and Ruben Specogna},
  journal={IEEE Transactions on Magnetics},
  year={2018},
  volume={54},
  pages={1-4}
}
Solving eddy current problems formulated by using a magnetic scalar potential in the insulator requires a topological pre-processing to find the so-called first cohomology basis of the insulating region, which may be very time-consuming for challenging industrially driven problems. The physics-inspired Dłotko–Specogna (DS) algorithm was shown to be superior to alternatives in performing such a topological pre-processing. Yet, the DS algorithm is particularly fast when it produces as output not… 

Figures and Tables from this paper

Fake Conductivity or Cohomology: Which to Use When Solving Eddy Current Problems With $h$ -Formulations?
There are two ways of solving eddy current problems with an edge element <inline-formula> <tex-math notation="LaTeX">$h$ </tex-math></inline-formula>-conforming formulation in the case of
- Formulation with Higher-Order Hierarchical Basis Functions for Nonsimply Connected Conductors
This paper presents in detail the extension of the - formulation for eddy currents based on higher-order hierarchical basis functions so that it can automatically deal with conductors of arbitrary
T-Ω formulation with higher order hierarchical basis functions for non simply connected conductors
This paper extends the T-Ω formulation for eddy currents based on higher order hierarchical basis functions so that it can deal with conductors of arbitrary topology. To this aim we supplement the
Fake Conductivity or Cohomology: Which to Use When Solving Eddy Current Problems With <inline-formula> <tex-math notation="LaTeX">$h$ </tex-math></inline-formula>-Formulations?
  • 2019

References

SHOWING 1-10 OF 24 REFERENCES
Cohomology in 3D Magneto-Quasistatics Modeling
TLDR
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.
Computation of Relative 1-Cohomology Generators From a 1-Homology Basis for Eddy Currents Boundary Integral Formulations
TLDR
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.
Lazy Cohomology Generators: A Breakthrough in (Co)homology Computations for CEM
TLDR
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
A novel technique for cohomology computations in engineering practice
Topoprocessor: An efficient computational topology toolbox for h-oriented eddy current formulations
When solving eddy-current problems containing topologically non-trivial conductors with formulations using the magnetic scalar potential in the insulators, cohomology is recognized to be the only
Hodge decompositions and computational electromagnetics
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
On making cuts for magnetic scalar potentials in multiply connected regions
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
An algorithm to make cuts for magnetic scalar potentials in tetrahedral meshes based on the finite element method
TLDR
It is shown that a finite element discretization can make the problem reduce to that of harmonic functions subject to peculiar interelement constraints and the effective degrees of freedom in the element assembly are identified with topological constraints.
Efficient generalized source field computation for h-oriented magnetostatic formulations
TLDR
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.
...
1
2
3
...