, Volume 90, Issue 3, pp 441-458

Multigrid algorithms for a vertex–centered covolume method for elliptic problems

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


We analyze V–cycle multigrid algorithms for a class of perturbed problems whose perturbation in the bilinear form preserves the convergence properties of the multigrid algorithm of the original problem. As an application, we study the convergence of multigrid algorithms for a covolume method or a vertex–centered finite volume element method for variable coefficient elliptic problems on polygonal domains. As in standard finite element methods, the V–cycle algorithm with one pre-smoothing converges with a rate independent of the number of levels. Various types of smoothers including point or line Jacobi, and Gauss-Seidel relaxation are considered.