论文信息 - A Neumann-Neumann algorithm for a mortar discretization of elliptic problems with discontinuous coefficients

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

Summary.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.

Maksymilian Dryja | M. Dryja

[1] Barbara I. Wohlmuth,et al. Discretization Methods and Iterative Solvers Based on Domain Decomposition , 2001, Lecture Notes in Computational Science and Engineering.

[2] Barry F. Smith,et al. Schwarz analysis of iterative substructuring algorithms for elliptic problems in three dimensions , 1994 .

[3] Barry F. Smith,et al. Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations , 1996 .

[4] Jacques-Louis Lions,et al. Nonlinear partial differential equations and their applications , 1998 .

[5] Yvon Maday,et al. The mortar element method for three dimensional finite elements , 1997 .

[6] O. Widlund,et al. Schwarz Methods of Neumann-Neumann Type for Three-Dimensional Elliptic Finite Element Problems , 1993 .

[7] Marian Brezina,et al. Balancing domain decomposition for problems with large jumps in coefficients , 1996, Math. Comput..

[8] Andrea Toselli,et al. Domain decomposition methods : algorithms and theory , 2005 .