2004Unpublished venueRequires access

Domain Decomposition Methods and Preconditioning

V. G. Korneev, Ulrich Langer

Open publisher page 24 citations

Abstract

Abstract Domain decomposition methods nowadays provide powerful tools for constructing efficient parallel solvers for large‐scale systems of algebraic equations arising from the discretization of partial differential equations. The classical alternating Schwarz method and the classical substructuring technique have led to advanced overlapping and nonoverlapping domain decomposition solvers (preconditioners), that can be analyzed from a unified point of view now called Schwarz theory . This survey article starts with a brief historical overview, provides the basic results of the Schwarz theory, looks at some overlapping domain decomposition methods (preconditioners) in brief, and discusses more extensively various nonoverlapping domain decomposition techniques.

About this research paper

What this paper is about

Abstract Domain decomposition methods nowadays provide powerful tools for constructing efficient parallel solvers for large‐scale systems of algebraic equations arising from the discretization of partial differential equations. The classical alternating Schwarz method and the classical substructuring technique have led to advanced overlapping and nonoverlapping domain decomposition solvers (preconditioners), that can be analyzed from a unified point of view now called Schwarz theory . This survey article starts with a brief historical overview, provides the basic results of the Schwarz theory, looks at some overlapping domain decomposition methods (preconditioners) in brief, and discusses more extensively various nonoverlapping domain decomposition techniques.

Why it matters

OpenAlex reports 24 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract Domain decomposition methods nowadays provide powerful tools for constructing efficient parallel solvers for large‐scale systems of algebraic equations arising from the discretization of partial differential equations. The classical alternating Schwarz method and the classical substructuring technique have led to advanced overlapping and nonoverlapping domain decomposition solvers (preconditioners), that can be analyzed from a unified point of view now called Schwarz theory . This survey article starts with a brief historical overview, provides the basic results of the Schwarz theory, looks at some overlapping domain decomposition methods (preconditioners) in brief, and discusses more extensively various nonoverlapping domain decomposition techniques.

Key concepts: Domain decomposition methods, Schwarz alternating method, Domain (mathematical analysis), Additive Schwarz method, Decomposition, Discretization, Computer science, Partial differential equation

Related papers

Back to paper searchBrowse research topicsOriginal source
Domain Decomposition Methods and Preconditioning — Research Paper | ScholarLens