Comparison of Line-Gauss-Seidel and Incomplete LU (Ilu) Relaxation in Multigrid Algorithms

摘要

The efficiency of Symmetric- and ZEBRA line-Gauss Seidel relaxation and Incomplete LU-factorization relaxation in multigrid algorithms are compared. To this end convergence rates are computed and an operations count was made for general regular 7-point discrete operators. As model problems for the numerical computation of the convergence rate the anisotropic diffusion and the convection diffusion equations are used.