TY - CHAP
T1 - Schur Complement Preconditioners for Distributed General Sparse Linear Systems
AU - Saad, Yousef
PY - 2007
Y1 - 2007
N2 - This paper discusses the Schur complement viewpoint when developing parallel preconditioners for general sparse linear systems. Schur complement methods are pervasive in numerical linear algebra where they represent a canonical way of implementing divide-and-conquer principles. The goal of this note is to give a brief overview of recent progress made in using these techniques for solving general, irregularly structured, sparse linear systems. The emphasis is to point out the impact of Domain Decomposition ideas on the design of general purpose sparse system solution methods, as well as to show ideas that are of a purely algebraic nature.
AB - This paper discusses the Schur complement viewpoint when developing parallel preconditioners for general sparse linear systems. Schur complement methods are pervasive in numerical linear algebra where they represent a canonical way of implementing divide-and-conquer principles. The goal of this note is to give a brief overview of recent progress made in using these techniques for solving general, irregularly structured, sparse linear systems. The emphasis is to point out the impact of Domain Decomposition ideas on the design of general purpose sparse system solution methods, as well as to show ideas that are of a purely algebraic nature.
UR - http://www.scopus.com/inward/record.url?scp=79952575540&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79952575540&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-34469-8_11
DO - 10.1007/978-3-540-34469-8_11
M3 - Chapter
AN - SCOPUS:79952575540
SN - 9783540344681
T3 - Lecture Notes in Computational Science and Engineering
SP - 127
EP - 138
BT - Domain Decomposition Methods in Science and Engineering XVI
PB - Springer Verlag
ER -