DMCA
Matrix-Dependent Prolongations and Restrictions in a Black-Box Multigrid Solver (1990)
| Citations: | 78 - 8 self |
BibTeX
@MISC{Zeeuw90matrix-dependentprolongations,
author = {P.M. de Zeeuw},
title = {Matrix-Dependent Prolongations and Restrictions in a Black-Box Multigrid Solver},
year = {1990}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Multigrid methods are studied for the solution of linear systems resulting from the 9-point discretization of a general linear second-order elliptic partial differential equation in two dimensions. The rate of convergence of standard multigrid methods often deteriorates when the coefficients in the differential equation are discontinuous, or when dominating first-order terms are present. These difficulties may be overcome by choosing the prolongation and restriction operators in a special way. A novel way to do this is proposed. As a result, a black-box solver (written in standard FORTRAN 77) has been developed. Numerical experiments for several hard test problems are described and comparison is made with other algorithms: the standard MG method and a method introduced by Kettler. A significant improvement of robustness and efficiency is found. Note: This chapter has been published in J. Comput. Appl. Math. 33 (1990) 1--27. 3.1 Introduction Consider the partial differential equation ...
Keyphrases
matrix-dependent prolongation black-box multigrid solver significant improvement differential equation standard fortran multigrid method special way partial differential equation standard multigrid method introduction consider several hard test problem 9-point discretization standard mg method black-box solver numerical experiment novel way first-order term restriction operator linear system
