A short note on standard parallel multigrid algorithms for 3D problems

摘要

We present some results concerning parallel multigrid (MG) algorithms for 3D problems. For certain—practically important—anisotropic cases, plane relaxation is needed for smoothing if standard MG (coarsening etc.) is used. Parallel versions of these sophisticated MG algorithms are described, and their time complexity and multiprocessor efficiency is studied.