Category:Domain decomposition methods: Difference between revisions

Revision as of 04:18, 11 March 2008

Revision as of 04:25, 11 March 2008

Line 1:

In mathematics, [[numerical analysis]] and numerical [[partial differential equation]]s, '''___domain decomposition methods''' solve a [[boundary value problem]] by splitting it into smaller boundary value problems and iterating to coordinate the solution between the subdomains. The solution of 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]].

{{main|Domain decomposition method}}