Balancing ___domain decomposition method: Difference between revisions

Revision as of 05:43, 12 March 2008

Revision as of 05:51, 12 March 2008

Line 7:

</ref>, which makes it however more expensive. The [[BDDC]] method uses the same corner basis functions as <ref name="LeTallec-1998-NND"/>, but in an additive rather than mutiplicative fashion <ref name="Mandel-2003-CBD"> J. Mandel and C. R. Dohrmann, ''Convergence of a balancing ___domain decomposition by constraints and energy minimization'', Numer. Linear Algebra Appl., 10 (2003), pp. 639--659.

</ref>. The dual counterpart to BDD is [[FETI]], which enforces the equality of the solution between the subdomain by Lagrange multipliers. The base versions of BDD and FETI are not mathematically equivalent, though a special version of FETI designed to be robust for hard problems <ref name="Bhardwaj-2000-AFM"> M. Bhardwaj, D. Day, C. Farhat, M. Lesoinne, K. Pierson, and D. Rixen, ''Application of the FETI method to ASCI problems -- scalability results on 1000 processors and discussion of highly heterogeneous problems}'', International Journal for Numerical Methods in Engineering, 47 (2000), pp. 513--535.

</ref> has the same eigenvalues and thus essentially the same performance as BDD <ref name="Fragakis-2007-FDD"> Y. Fragakis, ''Force and displacement duality in Domain Decomposition Methods for Solid and Structural Mechanics''. To appear in Comput. Methods Appl. Mech. Engrg., 2007.