The convergence theory for the restricted version of the overlapping Schur complement preconditioner

Xin Lu, Xing-ping Liu and Tong-xiang Gu

Applied Mathematics and Computation, 2018, vol. 339, issue C, 422-430

Abstract: The restricted version of the overlapping Schur complement (SchurRAS) preconditioner was introduced by Li and Saad (2006) for the solution of linear system Ax=b, and numerical results have shown that the SchurRAS method outperforms the restricted additive Schwarz (RAS) method both in terms of iteration count and CPU time. In this paper, based on meticulous derivation, we give an algebraic representation of the SchurRAS preconditioner, and prove that the SchurRAS method is convergent under the condition that A is an M-matrix and it converges faster than the RAS method.

Keywords: Restricted version of overlapping Schur complement; Convergence theory; Restricted additive Schwarz methods; Nonnegative matrix (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300318306039
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:339:y:2018:i:c:p:422-430

DOI: 10.1016/j.amc.2018.07.038

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().