Convergence of a standard adaptive nonconforming finite element method with optimal complexity (Q979208)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5726708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of a standard adaptive nonconforming finite element method with optimal complexity |
scientific article; zbMATH DE number 5726708 |
Statements
Convergence of a standard adaptive nonconforming finite element method with optimal complexity (English)
0 references
25 June 2010
0 references
In the paper the analysis of convergence and optimal complexity of the usual simple adaptive nonconforming finite element method by using Dörfler collective marking strategy is presented. It is shown the convergence of the adaptive algorithm by establishing the reduction of some total error and the quasi-optimal convergence rate. The analysis does not need the relation between the nonconforming P1 element and the mixed Raviart-Thomas element. The results of numerical experiments confirm that our adaptive algorithm is optimal.
0 references
adaptive methods
0 references
nonconforming finite elements
0 references
a posteriori error estimation
0 references
convergence rate
0 references
optimal computational complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9257221817970276
0 references
0.8892488479614258
0 references
0.8811703324317932
0 references
0.8636752367019653
0 references
0.8627236485481262
0 references
