2017
DOI: 10.1016/j.camwa.2017.02.019
|View full text |Cite
|
Sign up to set email alerts
|

h-adaptive least-squares finite element methods for the 2D Stokes equations of any order with optimal convergence rates

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…(c) Optimal convergence of adaptive least-square finite element methods driven by an equivalent weighted error estimators has been already proved for the Poisson problem in [CP15,Car20], the linear elasticity problem [BCS18], and the Stokes problem [BC17]. However, to the best of our knowledge, convergence for adaptive algorithms driven by the natural estimator is only known for the Poisson problem if D örfler marking with a sufficiently large bulk parameter is used, see [CPB17], where Q-linear convergence has been demonstrated.…”
Section: Theorem 33 (Convergence For (Pure) Homogeneous Dirichlet) Th...mentioning
confidence: 98%
“…(c) Optimal convergence of adaptive least-square finite element methods driven by an equivalent weighted error estimators has been already proved for the Poisson problem in [CP15,Car20], the linear elasticity problem [BCS18], and the Stokes problem [BC17]. However, to the best of our knowledge, convergence for adaptive algorithms driven by the natural estimator is only known for the Poisson problem if D örfler marking with a sufficiently large bulk parameter is used, see [CPB17], where Q-linear convergence has been demonstrated.…”
Section: Theorem 33 (Convergence For (Pure) Homogeneous Dirichlet) Th...mentioning
confidence: 98%
“…and define norms ⋅ ψ,t and ⋅ M,t in H ψ 0 (S, t) and H M 0 (S, t), respectively, as in (15). Finally, the (squared) re-scaled norm in the trial space is…”
Section: Robust Dpg Scheme For Large Domainsmentioning
confidence: 99%
“…Otherwise approximations suffer from long preasymptotic ranges of reduced convergence, a type of locking phenomenon. For a detailed analysis we refer to [27], and we note that a scaling of norms is required for least-squares methods as well, see [15,Section 3]. In order to not complicate the presentation, we restrain from providing all the details that are required to have a domain-robust approximation.…”
Section: Introductionmentioning
confidence: 99%