In this paper a Geometric T-Ω formulation to solve eddy-current problems on a tetrahedral mesh is presented. When non-simply-connected conducting regions are considered, the formulation requires the so-called thick cuts, while, in the literature, more attention is usually given to the so-called thin cuts. While the automatic construction of thin cuts has been theoretically solved many years ago, no implementation of an algorithm to compute the thick cuts which can be used in practice exists so far. In this paper, we propose how to fill this gap by introducing an algorithm to automatically compute the thick cuts on real-sized meshes, based on a belted tree and a tree-cotree decomposition. The belted tree is constructed by means of a homology computation by exploiting efficient reduction methods. A number of benchmarks are presented to demonstrate the generality and the robustness of the algorithm. A rigorous definition of thick cuts, which necessarily has to rely on cohomology, is presented in addition.

Automatic generation of cuts on large-sized meshes for the T–Omega geometric eddy-current formulation

SPECOGNA, Ruben;TREVISAN, Francesco
2009-01-01

Abstract

In this paper a Geometric T-Ω formulation to solve eddy-current problems on a tetrahedral mesh is presented. When non-simply-connected conducting regions are considered, the formulation requires the so-called thick cuts, while, in the literature, more attention is usually given to the so-called thin cuts. While the automatic construction of thin cuts has been theoretically solved many years ago, no implementation of an algorithm to compute the thick cuts which can be used in practice exists so far. In this paper, we propose how to fill this gap by introducing an algorithm to automatically compute the thick cuts on real-sized meshes, based on a belted tree and a tree-cotree decomposition. The belted tree is constructed by means of a homology computation by exploiting efficient reduction methods. A number of benchmarks are presented to demonstrate the generality and the robustness of the algorithm. A rigorous definition of thick cuts, which necessarily has to rely on cohomology, is presented in addition.
File in questo prodotto:
File Dimensione Formato  
cmame_cohomology_thick_cuts.pdf

non disponibili

Tipologia: Documento in Post-print
Licenza: Non pubblico
Dimensione 1.49 MB
Formato Adobe PDF
1.49 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
REG61_cmame_cohomology_thick_cuts.pdf

non disponibili

Tipologia: Altro materiale allegato
Licenza: Non pubblico
Dimensione 1.49 MB
Formato Adobe PDF
1.49 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
1-s2.0-S0045782509002539-main.pdf

non disponibili

Tipologia: Altro materiale allegato
Licenza: Non pubblico
Dimensione 1.49 MB
Formato Adobe PDF
1.49 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/722543
 Attenzione

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

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