e/Domain decomposition methods

Information
has gloss	eng: 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 preconditioners for Krylov space iterative methods, such as the conjugate gradient method or GMRES.
lexicalization	eng: Domain decomposition methods
subclass of	(noun) a way of doing something, especially a systematic way; implies an orderly logical arrangement (usually in steps) method
has instance	e/Abstract additive Schwarz method
has instance	e/Additive Schwarz method
has instance	e/BDDC
has instance	e/Balancing domain decomposition
has instance	e/Coarse space (numerical analysis)
has instance	e/FETI
has instance	e/FETI-DP
has instance	e/Mortar methods
has instance	e/Neumann-Dirichlet method
has instance	e/Neumann–Neumann methods
has instance	e/Poincare-Steklov operator
has instance	e/Schur complement method
has instance	e/Schwarz alternating method