Numerical analysis Iterative methods for linear systems Concept
Mortar methods
Summary
Mortar methods are finite element discretizations on a domain cut into subdomains whose meshes need not match across the interfaces. Continuity across an interface is not imposed point by point but weakly. The jump must be orthogonal to a space of multiplier functions, the mortar space. They let each subdomain use its own mesh and polynomial degree while keeping optimal error estimates. This makes them a standard tool of domain decomposition methods.
Further reading
About this page
| Tag | 33SJNF8V7Z |
|---|---|
| URI | m2://33SJNF8V7Z |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65N30, 65N55 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.