Multigrid algorithms for a vertex-centered covolume method for elliptic problems (Q1348919)
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: Multigrid algorithms for a vertex-centered covolume method for elliptic problems |
scientific article; zbMATH DE number 1742783
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multigrid algorithms for a vertex-centered covolume method for elliptic problems |
scientific article; zbMATH DE number 1742783 |
Statements
Multigrid algorithms for a vertex-centered covolume method for elliptic problems (English)
0 references
21 May 2002
0 references
Convergence analysis for multigrid algorithms of the covolume method or a vertex-centered finite volume element method for variable coefficient elliptic problems is presented. As in standard finite elements, the V-cycle algorithm with one pre-smoothing converges with a rate independent of the number of levels. Various types of smoothers including point or line Jacobi, and Gauss-Seidel relaxation are considered.
0 references
Jacobi method
0 references
convergence
0 references
covolume method
0 references
vertex-centered finite volume element method
0 references
variable coefficient elliptic problems
0 references
V-cycle algorithm
0 references
smoothing
0 references
Gauss-Seidel relaxation
0 references
0.91168547
0 references
0.9110857
0 references
0.90054995
0 references
0.90029395
0 references
0.8975402
0 references
0.89086974
0 references
0.88874257
0 references
