Metraipolis › archive › dc_65ad3dd2c460

Domain decomposition methods — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Domain_decomposition_methods
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-31T10:02:17.654Z
SHA-256 of the archived text
9cc700e6ab1bc60579946625fd4c4abba67906c2eceb4f83acd9c5aa8ce06889
Stable URL of this page
https://metraipolis.com/documento/dc_65ad3dd2c460

How to cite

Domain decomposition methods — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Domain_decomposition_methods (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_65ad3dd2c460 (Metraipolis archive dc_65ad3dd2c460, sha256 9cc700e6ab1bc60579946625fd4c4abba67906c2eceb4f83acd9c5aa8ce06889)
BibTeX
@misc{dc65ad3dd2c460,
  title = {Domain decomposition methods — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Domain_decomposition_methods},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_65ad3dd2c460; sha256 9cc700e6ab1bc60579946625fd4c4abba67906c2eceb4f83acd9c5aa8ce06889},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Domain_decomposition_methods. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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, GMRES, and LOBPCG. In overlapping domain decomposition methods, the subdomains overlap by more than the interface. Overlapping domain decomposition methods include the Schwarz alternating method and the additive Schwarz method. Many domain decomposition methods can be written and analyzed as a special case of the abstract additive Schwarz method. In non-overlapping methods, the subdomains intersect only on their interface. In primal methods, such as Balancing domain decomposition and BDDC, the continuity of the solution across subdomain interface is enforced by representing the value of the solution on all neighboring subdomains by the same unknown. In dual methods, such as FETI, the continuity of the solution across the subdomain interface is enforced by Lagrange multipliers. The FETI-DP method is hybrid between a dual and a primal method. Non-overlapping domain decomposition methods are also called iterative substructuring methods. Mortar methods are discretization methods for partial differential equations, which use separate discretization on nonoverlapping subdomains. The meshes on the subdomains do not match on the interface, and the equality of the solution is enforced by Lagrange multipliers, judiciously chosen to preserve the accuracy of the solution. In the engineering practice in the finite element method, continuity of solutions between non-matching subdomains is implemented by multiple-point constraints. Finite element simulations of moderate size models require solving linear systems with millions of unknowns. Several hours per time step is an average sequential run time, therefore, parallel computing is a necessity. Domain decomposition methods embody large potential for a parallelization of the finite element methods, and serve a basis for distributed, parallel computations.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «numerical analysis»).
Fonte: Wikipedia in inglese, voce «Domain decomposition methods» — https://en.wikipedia.org/wiki/Domain_decomposition_methods
Wikidata Q5289813: «type of numerical methods» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5289813
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Domain_decomposition_methods?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1359426171, consultata il 2026-10-31T09:46:19.962Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 886641f6a7f4fd37f22adf445270854f2d09a22246f54fb8eaed1f0d2889a5ef