Second Order Accurate Hierarchical Approximate Factorization of Sparse SPD Matrices
arXiv:2007.00789
Abstract
We describe a second-order accurate approach to sparsifying the off-diagonal blocks in the hierarchical approximate factorizations of sparse symmetric positive definite matrices. The norm of the error made by the new approach depends quadratically, not linearly, on the error in the low-rank approximation of the given block. The analysis of the resulting two-level preconditioner shows that the preconditioner is second-order accurate as well. We incorporate the new approach into the recent Sparsified Nested Dissection algorithm [SIAM J. Matrix Anal. Appl., 41 (2020), pp. 715-746], and test it on a wide range of problems. The new approach halves the number of Conjugate Gradient iterations needed for convergence, with almost the same factorization complexity, improving the total runtimes of the algorithm. Our approach can be incorporated into other rank-structured methods for solving sparse linear systems.
arXiv comment26 pages
References in corpus (5)
- A Fast Block Low-Rank Dense Solver with Applications to Finite-Element Matrices
- Fast hierarchical solvers for sparse matrices using extended sparsification and low-rank approximation
- A Robust Hierarchical Solver for Ill-conditioned Systems with Applications to Ice Sheet Modeling
- Robust and effective eSIF preconditioning for general SPD matrices
- Recursively Preconditioned Hierarchical Interpolative Factorization for Elliptic Partial Differential Equations