Multi-grid solution of three-dimensional problems with discontinuous coefficients
A three-dimensional multi-grid algorithm is developed and compared to an efficient three-dimensional Incomplete Cholesky Conjugate Gradient (ICCG) algorithm on a suite of test problems with discontinouous and/or anisotropic coefficients. The multi-grid algorithm used plane relaxation and a definition of coarse grid operators which is an extension of that used for two-dimensional problems with discontinuous coefficients. Numerical results show that the three dimensional results are not nearly as good as the two dimensional results on similar problems.