Domain decomposition methods: Difference between revisions

Revision as of 19:53, 18 September 2011

Revision as of 21:16, 18 September 2011

Line 1:

[[File:Ddm original logo.png|thumb|Domain decomposition methods]]

[[File:Non-conforming ___domain decomposition.png|thumb|Non-conforming ___domainDomain decomposition methods for non-conforming discretizations]]

In [[mathematics]], [[numerical analysis]], and [[numerical partial differential equations]], '''___domain decomposition methods''' solve a [[boundary value problem]] by splitting it into smaller boundary value problems on subdomains and iterating to coordinate the solution between adjacent subdomains. A [[coarse problem]] with one or few unknowns per subdomain is used to further coordinate the solution between the subdomains globally. The problems on the subdomains are independent, which makes ___domain decomposition methods suitable for [[parallel computing]]. Domain decomposition methods are typically used as [[preconditioner]]s for [[Krylov space]] [[iterative method]]s, such as the [[conjugate gradient method]] or [[GMRES]].