“…As discussed in [15], one cannot construct any vector basis that should be simultaneously curl-free and divergence-free. However, it is still possible to construct a vector basis that is locally divergence-free and globally curl-free.…”
Section: Multiply-connected Regionsmentioning
confidence: 99%
“…Reference [23] introduced an efficient cut-generating algorithm with computational complexity O(N 2 ) where N denotes the number of DOF's in the finite element discretization. The thickcut, which is one layer of tetrahedral elements having their edges passing through cutting surfaces, as introduced in [15,16] has the computational complexity O(N 1.5 ) or less for most practical simulations. Also, thick-cut can be naturally adapted to Hp assignment procedure.…”
Section: Multiply-connected Regionsmentioning
confidence: 99%
“…Note that the dimension of the column vector [χ], which is the degree of freedom (DOF) of the harmonic field component, is the number of loops, so it is independent of the mesh and orders of the basis functions. There are several approaches to model (21), the topological property of the harmonic field component [15][16][17][18][19][20][21][22][23]. Reference [23] introduced an efficient cut-generating algorithm with computational complexity O(N 2 ) where N denotes the number of DOF's in the finite element discretization.…”
Abstract-Based on a proposed inexact Hodge decomposition, this paper describes a viable scheme using the second order finite elements in the T-Ω method considering multiply-connected regions for the eddy current problems. Several numerical examples have been presented to demonstrate the effectiveness of this scheme.
“…As discussed in [15], one cannot construct any vector basis that should be simultaneously curl-free and divergence-free. However, it is still possible to construct a vector basis that is locally divergence-free and globally curl-free.…”
Section: Multiply-connected Regionsmentioning
confidence: 99%
“…Reference [23] introduced an efficient cut-generating algorithm with computational complexity O(N 2 ) where N denotes the number of DOF's in the finite element discretization. The thickcut, which is one layer of tetrahedral elements having their edges passing through cutting surfaces, as introduced in [15,16] has the computational complexity O(N 1.5 ) or less for most practical simulations. Also, thick-cut can be naturally adapted to Hp assignment procedure.…”
Section: Multiply-connected Regionsmentioning
confidence: 99%
“…Note that the dimension of the column vector [χ], which is the degree of freedom (DOF) of the harmonic field component, is the number of loops, so it is independent of the mesh and orders of the basis functions. There are several approaches to model (21), the topological property of the harmonic field component [15][16][17][18][19][20][21][22][23]. Reference [23] introduced an efficient cut-generating algorithm with computational complexity O(N 2 ) where N denotes the number of DOF's in the finite element discretization.…”
Abstract-Based on a proposed inexact Hodge decomposition, this paper describes a viable scheme using the second order finite elements in the T-Ω method considering multiply-connected regions for the eddy current problems. Several numerical examples have been presented to demonstrate the effectiveness of this scheme.
“…These fields are of central importance for numerical electromagnetism in general topological domains (see, e.g., Kotiuga [40], Kettunen et al [37]; see Bossavit [13], Gross and Kotiuga [31]). To make precise one of their most important properties, let us first give a definition: if the only linear combination of a maximal set of loop fields that equals a gradient is the trivial one, we say that those loop fields are linearly cohomologically independent.…”
Abstract. We devise an efficient algorithm for the finite element construction of discrete harmonic fields and the numerical solution of 3D magnetostatic problems. In particular, we construct a finite element basis of the first de Rham cohomology group of the computational domain. The proposed method works for general topological configurations and does not need the determination of "cutting" surfaces.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.