Automatic generation of cuts on large-sized meshes for the \(T-\Omega \) geometric eddy-current formulation
DOI10.1016/j.cma.2009.08.007zbMath1230.78038OpenAlexW2152410378WikidataQ112198381 ScholiaQ112198381MaRDI QIDQ660415
Ruben Specogna, Paweł Dłotko, Francesco Trevisan
Publication date: 1 February 2012
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cma.2009.08.007
computational homologyeddy-currentsautomatic cut generationbelted treehomology generatorsscalar potential in multiply-connected regions
Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Basic methods for problems in optics and electromagnetic theory (78M99)
Related Items
Uses Software
Cites Work
- Finite computability of Postnikov complexes
- Coreduction homology algorithm
- Homology computation by reduction of chain complexes
- NETGEN: An advancing front 2D/3D-mesh generator based on abstract rules
- Computational homology
- Generators of $H_1(\Gamma_{h},\mathbbZ)$ for Triangulated Surfaces: Construction and Classification
- Scalar potentials in multiply connected regions
- GeometricT–Ω approach to solve eddy currents coupled to electric circuits
- How to give an Exposition of the Cech-Alexander-Spanier type Homology Theory
- Discrete Vector Potentials for Nonsimply Connected Three-Dimensional Domains
- Electromagnetic Theory and Computation
- Geometric interpretation of finite‐dimensional eddy‐current formulations
- Curl‐conform source fields in finite element formulations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item