Jump to content

Category:Domain decomposition methods

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jmath666 (talk | contribs) at 04:18, 11 March 2008 (added main). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 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 preconditioners for Krylov space iterative methods, such as the conjugate gradient method or GMRES.