Efficient Preconditioning of hp-FEM Matrices by Hierarchical Low-Rank Approximations

We introduce a preconditioner based on a hierarchical low-rank compression scheme of Schur complements. The construction is inspired by standard nested dissection, and relies on the assumption that the Schur complements can be approximated, to high precision, by Hierarchically-Semi-Separable matrices. We build the preconditioner as an approximate factorization of a given matrix A, and no knowledge of A in assembled form is required by the construction. The factorization is amenable to fast inversion, and the action of the inverse can be determined fast as well. We investigate the behavior of the preconditioner in the context of DG finite element approximations of elliptic and hyperbolic problems, with respect to both the mesh size and the order of approximation.


Published in:
Journal Of Scientific Computing, 72, 1, 49-80
Year:
2017
Publisher:
New York, Springer Verlag
ISSN:
0885-7474
Keywords:
Laboratories:




 Record created 2017-07-10, last modified 2019-03-17

Preprint:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)