Schur Complement Preconditioners for Distributed General Sparse Linear Systems

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Scopus citations

Abstract

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 languageEnglish (US)
Title of host publicationDomain Decomposition Methods in Science and Engineering XVI
PublisherSpringer Verlag
Pages127-138
Number of pages12
ISBN (Print)9783540344681
DOIs
StatePublished - 2007

Publication series

NameLecture Notes in Computational Science and Engineering
Volume55
ISSN (Print)1439-7358

Fingerprint Dive into the research topics of 'Schur Complement Preconditioners for Distributed General Sparse Linear Systems'. Together they form a unique fingerprint.

Cite this