Comparison of second- and fourth-order discretizations for multigrid Poisson solvers (Q1357336)
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: Comparison of second- and fourth-order discretizations for multigrid Poisson solvers |
scientific article; zbMATH DE number 1019297
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of second- and fourth-order discretizations for multigrid Poisson solvers |
scientific article; zbMATH DE number 1019297 |
Statements
Comparison of second- and fourth-order discretizations for multigrid Poisson solvers (English)
0 references
13 January 1998
0 references
The authors compare multigrid algorithms for solving the Poisson equation discretized by using the five-point stencil (approximation order \(h^2\)) and a nine-point stencil (approximation order \(h^4\)). Within the multigrid algorithm different projection operators (e.g. full-injection, half-injection, full-weighting) and Gauss-Seidel smoothers with different orderings (red-black, four-colour, lexicographical) are used. The cost of arithmetical work and the storage cost of the multigrid \(V\)-cycle are discussed briefly for both discretizations. The presented numerical results show that the multigrid algorithm with full-weighting and red-black Gauss-Seidel smoother is the fastest algorithm in the case of the nine-point discretization. Furthermore, the experiments performed on serial and vector machines illustrate that the nine-point formula is superior to the five-point formula in both accuracy and computational efficiency.
0 references
Poisson equation
0 references
multigrid methods
0 references
finite difference discretization
0 references
numerical results
0 references
red-black Gauss-Seidel smoother
0 references
computational efficiency
0 references
0 references
0 references
0 references