Title: Iterative Substructuring Preconditioners for Mortar Element Methods in Two Dimensions
Abstract: The mortar methods are based on domain decomposition and they allow for the coupling of different variational approximations in different subdomains. The resulting methods are nonconforming but still yield optimal approximations. In this paper, we will discuss iterative substructuring algorithms for the algebraic systems arising from the discretization of symmetric, second-order, elliptic equations in two dimensions. Both spectral and finite element methods, for geometrically conforming as well as nonconforming domain decompositions, are studied. In each case, we obtain a polylogarithmic bound on the condition number of the preconditioned matrix.
Publication Year: 1999
Publication Date: 1999-01-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 96
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot