A robust algebraic multilevel domain decomposition preconditioner for sparse symmetric positive definite matrices

From MaRDI portal
Publication:5097609

DOI10.1137/21M1446320zbMATH Open1501.65013arXiv2109.05908OpenAlexW3199961046WikidataQ114073972 ScholiaQ114073972MaRDI QIDQ5097609FDOQ5097609


Authors: Hussam al Daas, Pierre Jolivet Edit this on Wikidata


Publication date: 25 August 2022

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: Domain decomposition (DD) methods are widely used as preconditioner techniques. Their effectiveness relies on the choice of a locally constructed coarse space. Thus far, this construction was mostly achieved using non-assembled matrices from discretized partial differential equations (PDEs). Therefore, DD methods were mainly successful when solving systems stemming from PDEs. In this paper, we present a fully algebraic multilevel DD method where the coarse space can be constructed locally and efficiently without any information besides the coefficient matrix. The condition number of the preconditioned matrix can be bounded by a user-prescribed number. Numerical experiments illustrate the effectiveness of the preconditioner on a range of problems arising from different applications.


Full work available at URL: https://arxiv.org/abs/2109.05908




Recommendations




Cites Work


Cited In (9)





This page was built for publication: A robust algebraic multilevel domain decomposition preconditioner for sparse symmetric positive definite matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097609)