Single-level multigrid

摘要

A single-level multigrid algorithm is developed in which coarse-grid correction is performed on the fine grid. This negates the need for coarse grid storage allocation resulting in easy programmability. The algorithm differs from unigrid in that it mimics multigrid V(0, v) cycles which effectively overcomes the inefficiency of the unigrid technique. The single-level algorithm is therefore both easy to program and efficient. It is illustrated by two numerical examples and compared with unigrid and conventional multigrid.