Convergence of the multigrid \(V\)-cycle algorithm for second-order boundary value problems without full elliptic regularity (Q2781207)
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: Convergence of the multigrid \(V\)-cycle algorithm for second-order boundary value problems without full elliptic regularity |
scientific article; zbMATH DE number 1720958
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence of the multigrid \(V\)-cycle algorithm for second-order boundary value problems without full elliptic regularity |
scientific article; zbMATH DE number 1720958 |
Statements
19 March 2002
0 references
multigrid \(V\)-cycle algorithm
0 references
Richardson relaxation scheme
0 references
second order elliptic boundary value problems
0 references
domain regularity
0 references
convergence
0 references
finite element method
0 references
0 references
0 references
0 references
0 references
0 references
0 references
Convergence of the multigrid \(V\)-cycle algorithm for second-order boundary value problems without full elliptic regularity (English)
0 references
The author considers a second order elliptic boundary value problem (Dirichlet) on some 2D polygonal domains with reentrant corners. For such problems, she analyses the effect of the lack of domain regularity on the asymptotic behavior of the contraction number of a \(V\)-cycle multigrid algorithm with respect to the number of smoothing steps. It is shown that the contraction number uniformly improves with the increase of the number of smoothing steps.
0 references
