Multilevel Gauss-Seidel-algorithms for full and sparse grid problems (Q2366295): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Michael Griebel / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Christoph Zenger / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Wilhelm Heinrichs / rank | |||
Normal rank | |||
Revision as of 04:25, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multilevel Gauss-Seidel-algorithms for full and sparse grid problems |
scientific article |
Statements
Multilevel Gauss-Seidel-algorithms for full and sparse grid problems (English)
0 references
29 June 1993
0 references
Grid-oriented and recently developed point-oriented robust multilevel methods for full and sparse grid discretizations are presented. The suitable properties for parallelization and anisotropic model problems are demonstrated. The techniques can easily be generalized to domain- oriented multilevel methods.
0 references
Gauss-Seidel-algorithms
0 references
anisotropic problems
0 references
block-Gauss-Seidel iteration
0 references
hiearchical basis
0 references
multigrid methods
0 references
point-oriented methods
0 references
semidefinite system
0 references
sparse grids
0 references
parallelization
0 references
domain-oriented multilevel methods
0 references
