Optimal multilevel methods for graded bisection grids (Q663266)
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: Optimal multilevel methods for graded bisection grids |
scientific article; zbMATH DE number 6006404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal multilevel methods for graded bisection grids |
scientific article; zbMATH DE number 6006404 |
Statements
Optimal multilevel methods for graded bisection grids (English)
0 references
14 February 2012
0 references
The authors design and analyze optimal additive and multiplicative multilevel methods for solving \(H^1\) problems on graded grids obtained by bisection. They present a novel decomposition of bisection grids, introduce and analyze economical local smoothers, and provide a unified framework for analysis of multilevel methods on graded bisection grids without the nested refinement assumption.
0 references
multilevel methods
0 references
graded bisection grids
0 references
quasi-uniform grids
0 references
adaptive finite element
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8537999987602234
0 references
0.7838531136512756
0 references
0.7838531136512756
0 references
0.7740258574485779
0 references
0.7723454236984253
0 references
