Table of Contents
ISRN Computational Mathematics
Volume 2012 (2012), Article ID 172687, 5 pages
Research Article

Evaluation of the Capability of the Multigrid Method in Speeding Up the Convergence of Iterative Methods

Department of Mechanical Engineering, Isfahan University of Technology, Isfahan 84156-83111, Iran

Received 20 December 2011; Accepted 11 January 2012

Academic Editor: R. Pandey

Copyright © 2012 Iman Harimi and Mohsen Saghafian. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The performance of the multigrid method and the effect of different grid levels on the convergence rate are evaluated. The two-, three-, and four-level V-cycle multigrid methods with the Gauss-Seidel iterative solver are employed for this purpose. The numerical solution of the one-dimensional Laplace equation with the Dirichlet boundary conditions is obtained using these methods. For the Laplace equation, a two-frequency function involving high- and low-frequency components is defined. It is observed that, however, the GS method can smooth out the high-frequency error components properly, but because the difference scheme for Laplace equation is remarkably concise, in the fine grids, a very large number of iterations are needed for extending the boundary conditions into the domain. Furthermore, the obtained results reveal that the number of necessary iterations for convergence is reduced considerably by employing the two-level multigrid algorithm. But increasing the number of levels of algorithm does not have any significant effect on the convergence rate in this study.