A domain decomposition method using efficient interface-acting preconditioners

Kräutle S (2005)


Publication Status: Published

Publication Type: Journal article, Original article

Publication year: 2005

Journal

Publisher: American Mathematical Society

Book Volume: 74

Pages Range: 1231-1256

Journal Issue: 251

URI: https://www.ams.org/journals/mcom/2005-74-251/S0025-5718-04-01706-5/S0025-5718-04-01706-5.pdf

DOI: 10.1090/S0025-5718-04-01706-5

Abstract

The conjugate gradient boundary iteration (CGBI) is a domain decomposition method for symmetric elliptic problems on domains with large aspect ratio. High efficiency is reached by the construction of preconditioners that are acting only on the subdomain interfaces. The theoretical derivation of the method and some numerical results revealing a convergence rate of 0.04-0.1 per iteration step are given in this article. For the solution of the local subdomain problems, both finite element (FE) and spectral Chebyshev methods are considered. © 2004 American Mathematical Society.

Authors with CRIS profile

How to cite

APA:

Kräutle, S. (2005). A domain decomposition method using efficient interface-acting preconditioners. Mathematics of Computation, 74(251), 1231-1256. https://dx.doi.org/10.1090/S0025-5718-04-01706-5

MLA:

Kräutle, Serge. "A domain decomposition method using efficient interface-acting preconditioners." Mathematics of Computation 74.251 (2005): 1231-1256.

BibTeX: Download