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.
|Original language||English (US)|
|Title of host publication||Domain Decomposition Methods in Science and Engineering XVI|
|Number of pages||12|
|State||Published - 2007|
|Name||Lecture Notes in Computational Science and Engineering|
Copyright 2020 Elsevier B.V., All rights reserved.