A Note on the Efficiency of Domain Decomposed Incomplete Factorizations
Authors:
- Tony F. ChanTCTony F. Chan
- Danny GoovaertsDGDanny Goovaerts
- 1 July 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 11 (4) , 794-803
Abstract
In the past several years, domain decomposition has been a very popular topic, motivated by the ease of parallelization. However, the question of whether it is better than parallelizing some standard sequential methods has seldom been directly addressed. In this paper it is shown, with some numerical examples, that the answer is affirmative in the case of iterative solutions of elliptic problems by preconditioned conjugate gradient iteration. Specifically shown is how to construct effective incomplete factorization preconditioners based on the domain decomposition principle. In addition to having all the advantages of domain decomposition, this also results in better convergence rates than the analogous preconditioners on the whole domain.Keywords
This publication has 14 references indexed in Scilit:
- The Neumann-Dirichlet domain decomposition method with inexact solvers on the subdomainsNumerische Mathematik, 1989
- Analysis of Preconditioners for Domain DecompositionSIAM Journal on Numerical Analysis, 1987
- A Fully Parallel Algorithm for the Symmetric Eigenvalue ProblemSIAM Journal on Scientific and Statistical Computing, 1987
- A Domain-Decomposed Fast Poisson Solver on a RectangleSIAM Journal on Scientific and Statistical Computing, 1987
- Iterative Methods for the Solution of Elliptic Problems on Regions Partitioned into SubstructuresSIAM Journal on Numerical Analysis, 1986
- An iterative method for elliptic problems on regions partitioned into substructuresMathematics of Computation, 1986
- The construction of preconditioners for elliptic problems by substructuring. IMathematics of Computation, 1986
- A capacitance matrix method for Dirichlet problem on polygon regionNumerische Mathematik, 1982
- A GENERALIZED CONJUGATE GRADIENT METHOD FOR THE NUMERICAL SOLUTION OF ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS1976
- On the Estimation of Sparse Jacobian MatricesIMA Journal of Applied Mathematics, 1974