Year: 2003
Author: Zhao-Hui Huang, Qian-Shun Chang
Journal of Computational Mathematics, Vol. 21 (2003), Iss. 4 : pp. 421–434
Abstract
By making use of the Gauss-Seidel-type solution method, the procedure for computing the interpolation operator of multigrid methods is simplified. This leads to a saving of computational time. Three new kinds of interpolation formulae are obtained by adopting different approximate methods, to try to enhance the accuracy of the interpolatory operator. A theoretical study proves the two-level convergence of these Gauss-Seidel-type MG methods. A series of numerical experiments is presented to evaluate the relative performance of the methods with respect to the convergence factor, CPU-time (for one V-cycle and the setup phase) and computational complexity.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2003-JCM-8884
Journal of Computational Mathematics, Vol. 21 (2003), Iss. 4 : pp. 421–434
Published online: 2003-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 14
Keywords: Multigrid methods Gauss-Seidel solution Interpolation formula Convergence.