Domain decomposition methods: Difference between revisions

Revision as of 23:07, 18 September 2011

Revision as of 23:09, 18 September 2011

Line 12:

[[Mortar method]]s 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 constraint]]s.

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 as a basis for distributed, parallel computations.

==See also==