FETI and Neumann-Neumann iterative substructuring methods: Connections and new results

• Published in: Communications on pure and applied mathematics Vol. 54; no. 1; pp. 57 - 90
• Main Authors: Klawonn, Axel, Widlund, Olof
• Format: Journal Article
• Language: English
• Published: New York John Wiley & Sons, Inc 01.01.2001
• ISSN: 0010-3640; 1097-0312
• DOI: 10.1002/1097-0312(200101)54:1<57::AID-CPA3>3.0.CO;2-D

The FETI and Neumann‐Neumann families of algorithms are among the best known and most severely tested domain decomposition methods for elliptic partial differential equations. They are iterative substructuring methods and have many algorithmic components in common, but there are also differences. The purpose of this paper is to further unify the theory for these two families of methods and to introduce a new family of FETI algorithms. Bounds on the rate of convergence, which are uniform with respect to the coefficients of a family of elliptic problems with heterogeneous coefficients, are established for these new algorithms. The theory for a variant of the Neumann‐Neumann algorithm is also redeveloped stressing similarities to that for the FETI methods. © 2001 John Wiley & Sons, Inc.