Balancing ___domain decomposition method: Difference between revisions

Revision as of 01:29, 13 April 2009

Revision as of 07:52, 7 July 2010

Line 3:

</ref>. In each iteration, it combines the solution of local problems on non-overlapping subdomains with a coarse problem created from the subdomain [[null space|nullspaces]]. BDD requires only solution of subdomain problems rather than access to the matrices of those problems, so it is applicable to situations where only the solution operators are available, such as in [[oil reservoir]] [[simulation]] by [[mixed finite elements]] <ref name="Cowsar-1995-BDD"> L. C. Cowsar, J. Mandel, and M. F. Wheeler, ''Balancing ___domain decomposition for mixed finite elements'', Math. Comp., 64 (1995), pp. 989&ndash;1015.

</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&ndash;Neumann ___domain decomposition algorithm for solving plate and shell problems'', SIAM Journal on Numerical Analysis, 35 (1998), pp. 836&ndash;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 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.