Schur complement‐based domain decomposition preconditioners with low‐rank corrections |
| |
| Authors: | Ruipeng Li Yuanzhe Xi Yousef Saad |
| |
| Affiliation: | 1. Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, U.S.A.;2. Department of Computer Science & Engineering, University of Minnesota, Minneapolis, MN, U.S.A. |
| |
| Abstract: | This paper introduces a robust preconditioner for general sparse matrices based on low‐rank approximations of the Schur complement in a Domain Decomposition framework. In this ‘Schur Low Rank’ preconditioning approach, the coefficient matrix is first decoupled by a graph partitioner, and then a low‐rank correction is exploited to compute an approximate inverse of the Schur complement associated with the interface unknowns. The method avoids explicit formation of the Schur complement. We show the feasibility of this strategy for a model problem and conduct a detailed spectral analysis for the relation between the low‐rank correction and the quality of the preconditioner. We first introduce the SLR preconditioner for symmetric positive definite matrices and symmetric indefinite matrices if the interface matrices are symmetric positive definite. Extensions to general symmetric indefinite matrices as well as to nonsymmetric matrices are also discussed. Numerical experiments on general matrices illustrate the robustness and efficiency of the proposed approach. Copyright © 2016 John Wiley & Sons, Ltd. |
| |
| Keywords: | low‐rank approximation domain decomposition general sparse linear system parallel preconditioner Krylov subspace method the Lanczos algorithm |
|
|
