A Neumann-Neumann algorithm for a mortar discretization of elliptic problems with discontinuous coefficients

Authors:
Maksymilian Dryja
Affiliations:
Warsaw University, Department of Mathematics, Banacha 2, 02-097, Warsaw, Poland
Venue:
Numerische Mathematik
Year:
2005

Citing 0
Cited 5

A second order virtual node method for elliptic problems with interfaces and irregular domains

Journal of Computational Physics
A balancing domain decomposition method for a discretization of a plate problem on nonmatching grids

PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Schwarz preconditioned CG algorithm for the mortar finite element

Numerical Algorithms
A second order virtual node method for elliptic problems with interfaces and irregular domains in three dimensions

Journal of Computational Physics
Parallel preconditioner for nonconforming adini discretization of a plate problem on nonconforming meshes

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I

Quantified Score

Hi-index	0.01

Visualization

Abstract

Neumann-Neumann algorithm have been well developed for standard finite element discretization of elliptic problems with discontinuous coefficients. In this paper, an algorithm of this kind is designed and analyzed for a mortar finite element discretization of problems in three dimensions. It is established that its rate of convergence is independent of the discretization parameters and jumps of coefficients between subregions. The algorithm is well suited for parallel computations.