MULTILEVEL GAUSS-SEIDEL-ALGORITHMS FOR FULL AND SPARSE GRID PROBLEMS

Authors
GRIEBEL M ZENGER C ZIMMER S
Citation
M. Griebel et al., MULTILEVEL GAUSS-SEIDEL-ALGORITHMS FOR FULL AND SPARSE GRID PROBLEMS, Computing, 50(2), 1993, pp. 127-148
Citations number
18
Categorie Soggetti
Computer Sciences","Computer Applications & Cybernetics
Journal title
Computing → ACNP
ISSN journal
0010485X
Volume
50
Issue
2
Year of publication
1993
Pages
127 - 148
Database
ISI
SICI code
0010-485X(1993)50:2<127:MGFFAS>2.0.ZU;2-S
Abstract
We present grid-oriented and newly developed point-oriented robust mul tilevel methods for full and sparse grid discretizations. Especially t he point-oriented multilevel methods are very well suited for parallel ization and behave robust for anisotropic model problems. They can be generalized easily to domain-oriented multilevel methods with the same properties. We report the results of numerical experiments regarding the reduction rates of these new algorithms.