In the case of convection dominated problems, multi-grid me thods require an appropriate smoothing to ensure robustness. As a first approach we discuss a Gauß-Seidel smoo thing with a correct numbering of the unknowns and if necessary a special block partitioning. Numerical ex periments show that, in the case of general convection directions, the multi-grid 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 des cribe a numbering algorithms which is valid for all spatial dimensions. Cycles give rise to special blocks for a blockwise Gauß-Seidel smoothing. We describe an algorithm for the two-dimensional case. The proposed algor ithms require a computational work of optimal order (linear in the size of the problem).
[1]
Wolfgang Hackbusch,et al.
Multi-grid methods and applications
,
1985,
Springer series in computational mathematics.
[2]
Numerische,et al.
Fourier analysis of a robust multigrid method for convection-diffusion equations
,
2022
.
[3]
W. Hackbusch.
Elliptic Differential Equations
,
1992
.
[4]
W. Hackbusch.
Iterative Solution of Large Sparse Systems of Equations
,
1993
.
[5]
Gerhard Reinelt,et al.
The linear ordering problem: algorithms and applications
,
1985
.
[6]
Gabriel Wittum,et al.
Downwind Numbering : A Robust Multigrid Method for Convection-Diffusion Problems on Unstructured Grids
,
1995
.