Abstract
The multigrid V-cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction number of the V-cycle algorithm is shown to improve uniformly with the increase of the number of smoothing steps, without assuming full elliptic regularity. As a consequence, the V-cycle convergence result of Braess and Hackbusch is generalized to problems without full elliptic regularity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have