ISSN:
1436-5057
Keywords:
AMS Subject Classifications: 65F10, 65N20.
;
Key Words: Incomplete factorization, hierarchical orderings, approximate Schur complement preconditioners.
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We investigate multilevel incomplete factorizations of M-matrices arising from finite difference discretizations. The nonzero patterns are based on special orderings of the grid points. Hence, the Schur complements that result from block elimination of unknowns refer to a sequence of hierarchical grids. Having reached the coarsest grid, Gaussian elimination yields a complete decomposition of the last Schur complement. The main focus of this paper is a generalization of the recursive five-point/nine-point factorization method (which can be applied in two-dimensional problems) to matrices that stem from discretizations on three-dimensional cartesian grids. Moreover, we present a local analysis that considers fundamental grid cells. Our analysis allows to derive sharp bounds for the condition number associated with one factorization level (two-grid estimates). A comparison in case of the Laplace operator with Dirichlet boundary conditions shows: Estimating the relative condition number of the multilevel preconditioner by multiplying corresponding two-grid values gives the asymptotic bound O(h −0.347) for the two- respectively O(h −4/5) for the three-dimensional model problem.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s006070070016
Permalink
