 | This mathematics-related article is a stub. You can help Wikipedia by expanding it. |
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.
Non-overlapping ___domain decomposition methods are also called iterative substructuring methods.