1998
DOI: 10.1109/20.717588
|View full text |Cite
|
Sign up to set email alerts
|

Discrete spaces for div and curl-free fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
22
0

Year Published

2000
2000
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(22 citation statements)
references
References 4 publications
0
22
0
Order By: Relevance
“…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%
See 2 more Smart Citations
“…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%
See 1 more Smart Citation
“…The complement of in is called De Rham's th cohomology group. Dimension of depends on the topology of the manifold [11].…”
Section: Differential Forms and De Rham's Complexmentioning
confidence: 99%
“…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.…”
mentioning
confidence: 99%