摘要
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.
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.
基金
This work is supported in part by a grant (No.19931030) from the National Natural Science Foundation of China
