Neumann-Neumann methods

From Wikipedia, the free encyclopedia

Neumann-Neumann methods are domain decomposition preconditioners named so because they solve a Neumann problem on each subdomain on both sides of the interface between the subdomains.^[1] Just like all domain decomposition methods, so that the number of iterations does not grow with the number of subdomains, Neumann-Neumann methods require the solution of a coarse problem to provide global communication. The balancing domain decomposition is a Neumann-Neumann method with a special kind of coarse problem.

[edit] References

1. ^ A. Klawonn and O. B. Widlund, FETI and Neumann-Neumann iterative substructuring methods: connections and new results, Comm. Pure Appl. Math., 54 (2001), pp. 57--90.

[edit] See also

• Neumann-Dirichlet method