2010
DOI: 10.1002/nla.694
|View full text |Cite
|
Sign up to set email alerts
|

Convergence of adaptive edge finite element methods for H(curl)‐elliptic problems

Abstract: SUMMARYThe standard adaptive edge finite element method (AEFEM), using first/second family Nédélec edge elements with any order, for the three-dimensional H(curl)-elliptic problems with variable coefficients is shown to be convergent for the sum of the energy error and the scaled error estimator. The special treatment of the data oscillation and the interior node property are removed from the proof. Numerical experiments indicate that the adaptive meshes and the associated numerical complexity are quasi-optima… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
14
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(14 citation statements)
references
References 22 publications
0
14
0
Order By: Relevance
“…Zhong et al . 13 prove convergence of the adaptive edge finite element method for three‐dimensional H (curl)‐elliptic problems discretized with Nédélec edge elements (first or second families) of any order. The complexity of the method is shown numerically to be quasi‐optimal.…”
mentioning
confidence: 94%
“…Zhong et al . 13 prove convergence of the adaptive edge finite element method for three‐dimensional H (curl)‐elliptic problems discretized with Nédélec edge elements (first or second families) of any order. The complexity of the method is shown numerically to be quasi‐optimal.…”
mentioning
confidence: 94%
“…The relevant research in the case of Maxwell's equations, which dated back to Beck et al [10], has also reached a mature level nowadays (cf. [34,53,67,68]). However, the theory of AFEMs for PDE-constrained optimization problems is still a work in progress.…”
Section: Introductionmentioning
confidence: 99%
“…One of the key technical tools, a Helmholtz decomposition, used in this proving mechanism, relies on f being in H(div), and fails if f / ∈ H(div). In [12], the assumption that f ∈ H(div) is weakened to f being in the piecewise H(div) space with respect to the triangulation, at the same time, the divergence residual and norm jump are modified to incorporate this relaxation. Another drawback of using Helmholtz decomposition on the error is that it introduces the assumption of the coefficients' quasi-monotonicity into the proof pipeline.…”
Section: Introductionmentioning
confidence: 99%