Numerical experiments have shown that two-level Schwarz methods often perform very well even if the overlap between neighboring subregions is quite small. This is true to an even greater extent for a related algorithm, due to Barry Smith, where a Schwarz algorithm is applied to the reduced linear system of equations that remains after that the variables interior to the subregions have been eliminated. In this paper, a supporting theory is developed.

. We consider two level overlapping Schwarz domain decomposition methods for solving the finite element problems that arise from discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Standard finite element interpolation from the coarse to the fine grid may be used. Our theory requires no assumption on the substructures which constitute the whole domain, so each substructure can be of arbitrary shape and of different size. The global coarse mesh is allowed to be non-nested to the fine grid on which the discrete problem is to be solved and both the coarse meshes and the fine meshes need not be quasi-uniform. In addition, the domains defined by the fine and coarse grid need not be identical. The one important constraint is that the closure of the coarse grid must cover any portion of the fine grid boundary for which Neumann boundary conditions are given. In this general setting, our algorithms have the same optimal convergence rate of the usual ...

Abstract. We propose a substructuring preconditioner for solving threedimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner proposed by Bramble, Pasiack and Schatz (1989), but with much simpler coarse solvers. Though the condition number of the preconditioned system may not have a good bound, we are able to show that the convergence rate of the PCG method with such substructuring preconditioner is nearly optimal, and also robust with respect to the (possibly large) jumps of the coefficient in the elliptic equation. 1.

Abstract not found

. The purpose of this paper is to give a unified investigation of a class of nonoverlapping domain decomposition methods for solving second-order elliptic problems in two and three dimensions. The methods under scrutiny fall into two major categories: the substructuring--type methods and the Neumann--Neumann-type methods. The basic framework used for analysis is the parallel subspace correction method or additive Schwarz method, and other technical tools include local-global and global-local techniques. The analyses for both two- and three-dimensional cases are carried out simultaneously. Some internal relationships between various algorithms are observed and several new variants of the algorithms are also derived. Key words. nonoverlapping domain decomposition, Schur complement, local-global and globallocal techniques, jumps in coe#cients, substructuring, Neumann--Neumann, balancing methods AMS subject classifications. 65N30, 65N55, 65F10 PII. S0036144596306800 1. Introduction. T...

. We give several additive Schwarz domain decomposition methods for solving finite element problems which arise from the discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Our theory requires no assumption (for the main results) on the substructures which constitute the whole domain, so each substructure can be of arbitrary shape and of different size. The global coarse mesh is allowed to be non-nested to the fine grid on which the discrete problem is to be solved and both the coarse meshes and the fine meshes need not be quasi-uniform. In this general setting, our algorithms have the same optimal convergence rate of the usual domain decomposition methods on structured meshes. The condition numbers of the preconditoned systems depend only on the (possibly small) overlap of the substructures and the size of the coarse grid, but is independent of the sizes of the subdomains. Key Words. Unstructured meshes, non-nested coarse meshes, additive ...

. In this paper domain decomposition algorithms for mixed finite element methods for linear and quasilinear second order elliptic problems in IR 2 and IR 3 are developed. A convergence theory for two-level and multilevel Schwarz methods applied to the algorithms under consideration is given, and its extension to other substructuring methods such as vertex space and balancing domain decomposition methods is considered. It is shown that the condition number of these iterative methods is bounded uniformly from above in the same manner as in the theory of domain decomposition methods for conforming and nonconforming finite element methods for the same differential problems. Numerical experiments are presented to illustrate the present techniques. 1. Introduction. This is the second paper of a sequence where we develop and analyze efficient iterative algorithms for solving the linear system arising from mixed finite element methods for linear and quasilinear second order elliptic proble...

We consider a number of practical issues associated with the parallel distributed memory solution of elliptic partial differential equations using unstructured meshes in two dimensions. The first part of the paper describes a parallel mesh generation algorithm which is designed both for efficiency and to produce a well-partitioned, distributed mesh, suitable for the efficient parallel solution of an elliptic p.d.e. The second part of the paper concentrates on parallel domain decomposition preconditioning for the linear algebra problems which arise when solving such a p.d.e. on the unstructured meshes that we generate. It is demonstrated that by allowing the mesh generator and the p.d.e. solver to share a certain coarse grid structure we are able to obtain efficient parallel solutions to a number of large problems. Although the work is presented here in a finite element context, the issues of mesh generation and domain decomposition are not of course strictly dependent upon this particu...

Numerical experiments have shown that two-level Schwarz methods, for the solution of discrete elliptic problems, often perform very well even if the overlap between neighboring subregions is quite small. This is true to an even greater extent for a related algorithm, due to Barry Smith, where a Schwarz algorithm is applied to the reduced linear system of equations that remains after that the variables interior to the subregions have been eliminated. A supporting theory is outlined.

In this paper we describe, analyse and implement a parallel iterative method for the solution of the steady-state drift diffusion equations governing the behaviour of a semiconductor device in two space dimensions. The unknowns in our model are the electrostatic potential and the electron and hole quasi-Fermi potentials. Our discretisation consists of a finite element method with mass lumping for the electrostatic potential equation and a hybrid finite element with local current conservation properties for the continuity equations. A version of Gummel's decoupling algorithm which only requires the solution of positive definite symmetric linear systems is used to solve the resulting nonlinear equations. We show that this method has an overall rate of convergence which only degrades logarithmically as the mesh is refined. Indeed the (inner) nonlinear solves of the electrostatic potential equation converge quadratically, with a mesh independent asymptotic constant. We also describe an imp...