The systematic potential design is of high importance in computational electromagnetics. For example, it is well known that when the efficient eddy-current formulations based on a magnetic scalar potential are employed in problems which involve conductive regions with holes, the so-called thick cuts are needed to make the boundary value problem well defined. Therefore, a considerable effort has been invested over the past twenty-five years to develop fast and general algorithms to compute thick cuts automatically. Nevertheless, none of the approaches proposed in literature meet all the requirements of being automatic, computationally efficient and general. In this paper, an automatic, computationally efficient and provably general algorithm is presented. It is based on a rigorous algorithm to compute a cohomology basis of the insulating region with state-of-art reductions techniques-the acyclic sub-complex technique, among others-expressly designed for cohomology computations over simplicial complexes. Its effectiveness is demonstrated by presenting a number of practical benchmarks. The automatic nature of the proposed approach together with its low computational time enable the routinely use of cohomology computations in computational electromagnetics.

Efficient cohomology computation for electromagnetic modeling

SPECOGNA, Ruben
2010-01-01

Abstract

The systematic potential design is of high importance in computational electromagnetics. For example, it is well known that when the efficient eddy-current formulations based on a magnetic scalar potential are employed in problems which involve conductive regions with holes, the so-called thick cuts are needed to make the boundary value problem well defined. Therefore, a considerable effort has been invested over the past twenty-five years to develop fast and general algorithms to compute thick cuts automatically. Nevertheless, none of the approaches proposed in literature meet all the requirements of being automatic, computationally efficient and general. In this paper, an automatic, computationally efficient and provably general algorithm is presented. It is based on a rigorous algorithm to compute a cohomology basis of the insulating region with state-of-art reductions techniques-the acyclic sub-complex technique, among others-expressly designed for cohomology computations over simplicial complexes. Its effectiveness is demonstrated by presenting a number of practical benchmarks. The automatic nature of the proposed approach together with its low computational time enable the routinely use of cohomology computations in computational electromagnetics.
File in questo prodotto:
File Dimensione Formato  
cmes.2010.060.247.pdf

non disponibili

Tipologia: Altro materiale allegato
Licenza: Non pubblico
Dimensione 8.94 MB
Formato Adobe PDF
8.94 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11390/879044
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 24
  • ???jsp.display-item.citation.isi??? 24
social impact