Domain Decomposition Method

A class of numerical strategies that partition a global computational domain into subdomains, solve (exactly or approximately) boundary-value problems on these subdomains—possibly in parallel—and enforce interface conditions through coupling, iteration, or coarse-grid corrections to obtain the global solution.