How to recover the gradient of linear elements on nonuniform triangulations (Q1363447)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to recover the gradient of linear elements on nonuniform triangulations |
scientific article; zbMATH DE number 1046548
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to recover the gradient of linear elements on nonuniform triangulations |
scientific article; zbMATH DE number 1046548 |
Statements
How to recover the gradient of linear elements on nonuniform triangulations (English)
0 references
7 August 1997
0 references
It is well known that the theoretical optimal rate of approximation of linear finite elements in \(\mathbb{R}^d\) is of order \(O(h^2)\) in \(L^q\)-norm for \(d<2q\) whereas it is only \(O(h)\) for their gradient. In the present paper, a simple postprocessing is investigated which leads, on completely irregular triangulations, to the \(O(h^2)\) accuracy in \(L^q\)-norm of the interpolation error and \(O(h)\) in \(W^1_q\)-norm provided that the family of triangulations is strongly regular. This postprocessing consists in a simple weighted averaging procedure, which has, moreover, some superconvergence properties on quasiuniform triangulations. The theoretical results are tested on some numerical examples.
0 references
weighted averaged gradient
0 references
linear elements
0 references
nonuniform triangulations
0 references
superapproximation
0 references
superconvegence
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references