Abstract
This paper describes a multilevel preconditioning technique for solving sparse symmetric linear systems of equations. This "Multilevel Schur Low-Rank" (MSLR) preconditioner first builds a tree structure T based on a hierarchical decomposition of the matrix and then computes an approximate inverse of the original matrix level by level. Unlike classical direct solvers, the construction of the MSLR preconditioner follows a top-down traversal of T and exploits a low-rank property that is satisfied by the difference between the inverses of the local Schur complements and specific blocks of the original matrix. A few steps of the generalized Lanczos tridiagonalization procedure are applied to capture most of this difference. Numerical results are reported to illustrate the efficiency and robustness of the MSLR preconditioner with both two- and three-dimensional discretized PDE problems and with publicly available test problems.
Original language | English (US) |
---|---|
Pages (from-to) | 235-259 |
Number of pages | 25 |
Journal | SIAM Journal on Matrix Analysis and Applications |
Volume | 37 |
Issue number | 1 |
DOIs | |
State | Published - 2016 |
Bibliographical note
Publisher Copyright:Copyright © by SIAM. Unauthorized reproduction of this article is prohibited.
Keywords
- Domain decomposition
- Incomplete factorization
- Krylov subspace methods
- Low-rank approximation
- Multilevel preconditioner
- Nested Dissection ordering
- Schur complements