Balancing ___domain decomposition method: Difference between revisions

Revision as of 06:10, 12 March 2008

Revision as of 05:39, 13 March 2008

Line 13:

</ref><ref name="Sousedik-2008-EPD"> B. Sousedík and J. Mandel, ''On the equivalence of primal and dual substructuring preconditioners''. arXiv:math/0802.4328, 2008.</ref>.

The operator of the system solved by BDD is the same as obtained by eliminating the unknowns in the interiors of the subdomain, thus reducing the problem to the [[Schur complement]] on the subdomain interface. Since the BDD preconditioner involves the solution of [[Neumann problem]]s on all subdomain, it belongs to class of [[Neumann-Neumann methods]], named so because they solve a Neumann problem on both sides of the interface between subdomains.<ref name="Klawonn-2001-FNN"> 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.</ref>

==References==