Premium
Downwind Gauß‐Seidel Smoothing for Convection Dominated Problems
Author(s) -
Hackbusch Wolfgang,
Probst Thomas
Publication year - 1997
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/(sici)1099-1506(199703/04)4:2<85::aid-nla100>3.0.co;2-2
Subject(s) - smoothing , multigrid method , numbering , algorithm , mathematics , robustness (evolution) , mathematical optimization , gauss–seidel method , computer science , iterative method , partial differential equation , mathematical analysis , biochemistry , statistics , chemistry , gene
In the case of convection dominated problems, multigrid methods require an appropriate smoothing to ensure robustness. As a first approach we discuss a Gauss–Seidel smoothing with a correct numbering of the unknowns and if necessary a special block partitioning. Numerical experiments show that, in the case of general convection directions, the multigrid algorithms obtained in this way have the same properties as in the model situation. If the graph arising from the convection part is acyclic, we describe a numbering algorithm which is valid for all spatial dimensions. Cycles give rise to special blocks for a blockwise Gauss–Seidel smoothing. We describe an algorithm for the two‐dimensional case. The proposed algorithm requires a computational work of optimal order (linear in the size of the problem). © 1997 by John Wiley & Sons, Ltd.