Content deleted Content added
m clean up, References after punctuation per WP:REFPUNC and WP:PAIC using AWB (8434) |
m Typo fixing, replaced: mutiplicative → multiplicative using AWB |
||
Line 5:
</ref> In its original formulation, BDD performs well only for 2nd order problems, such [[Elasticity (physics)|elasticity]] in 2D and 3D. For 4th order problems, such as [[plate bending]], it needs to be modified by adding to the coarse problem special basis functions that enforce continuity of the solution at subdomain corners,<ref name="LeTallec-1998-NND">P. Le Tallec, J. Mandel, and M. Vidrascu, ''A Neumann–Neumann ___domain decomposition algorithm for solving plate and shell problems'', SIAM Journal on Numerical Analysis, 35 (1998), pp. 836–867.
</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
</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.
| |||