Language:   Search:   Contact
World of
Mathematics
Database
»ZBMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZBMATH«
ZBMATH Database | Advanced Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

ZBMATH Database Simple Search Advanced Search Command Search

Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 0788.65037
Xu, Jinchao
Iterative methods by space decomposition and subspace correction.
(English)
[J] SIAM Rev. 34, No.4, 581-613 (1992). ISSN 0036-1445; ISSN 1095-7200/e

This paper gives a systematic introduction to a number of iterative methods for symmetric positive definite problems. It presents a unified theory for iterative algorithms such as Jacobi and Gauss-Seidel iterations, diagonal preconditioning, domain decomposition techniques, multigrid methods, multilevel nodal basis preconditioners and hierarchical basis methods. By using the notions of space decomposition and subspace correction, all these algorithms are classified into two groups: parallel subspace correction (PSC) and successive subspace correction (SSC) methods. These two types of methods are similar in nature to the familiar Jacobi and Gauss-Seidel methods, respectively.\par The above framework of theory is used to establish a quite general abstract theory of convergence which may be applied relatively simply to a particular problem. It is only necessary to specify a decomposition of the underlying space and the corresponding subspace solvers. The paper is organized as follows: \S 2 gives a brief discussion of self-adjoint operators and the conjugate gradient method. In \S 3 a general framework for linear iterative methods for symmetric positive problems is presented. In \S 4 an abstract theory of convergence is established for the algorithms in the framework of \S 3. As a preparation for applications of the theory \S 5 introduces a model finite element method. The rest of the paper is devoted to multilevel and domain decomposition methods.
[H.Weber (Wiesbaden)]
MSC 2000:
*65F10 Iterative methods for linear systems
65F35 Matrix norms, etc. (numerical linear algebra)
65N55 Multigrid methods; domain decomposition (BVP of PDE)
65N30 Finite numerical methods (BVP of PDE)

Keywords: iterative methods; Jacobi and Gauss-Seidel iterations; diagonal preconditioning; domain decomposition; multigrid methods; multilevel nodal basis preconditioners; hierarchical basis methods; space decomposition; subspace correction; convergence; conjugate gradient method; finite element method

Cited in: Zbl 0947.65132

Login Username: Password:

Highlights
Scientific prize winners of the ICM 2010
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster