Results 1  10
of
33
Schwarz Analysis Of Iterative Substructuring Algorithms For Elliptic Problems In Three Dimensions
 SIAM J. Numer. Anal
, 1993
"... . Domain decomposition methods provide powerful preconditioners for the iterative solution of the large systems of algebraic equations that arise in finite element or finite difference approximations of partial differential equations. The preconditioners are constructed from exact or approximate sol ..."
Abstract

Cited by 110 (26 self)
 Add to MetaCart
. Domain decomposition methods provide powerful preconditioners for the iterative solution of the large systems of algebraic equations that arise in finite element or finite difference approximations of partial differential equations. The preconditioners are constructed from exact or approximate solvers for the same partial differential equation restricted to a set of subregions into which the given region has been divided. In addition, the preconditioner is often augmented by a coarse, second level approximation, that provides additional, global exchange of information, and which can enhance the rate of convergence considerably. The iterative substructuring methods, based on decompositions of the region into nonoverlapping subregions, form one of the main families of such algorithms. Many domain decomposition algorithms can conveniently be described and analyzed as Schwarz methods. These algorithms are fully defined in terms of a set of subspaces and auxiliary bilinear forms. A gener...
Domain Decomposition Algorithms With Small Overlap
, 1994
"... Numerical experiments have shown that twolevel 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 ..."
Abstract

Cited by 82 (11 self)
 Add to MetaCart
Numerical experiments have shown that twolevel 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.
Schwarz Methods of NeumannNeumann Type for ThreeDimensional Elliptic Finite Element Problems
 Comm. Pure Appl. Math
, 1995
"... . Several domain decomposition methods of NeumannNeumann type are considered for solving the large linear systems of algebraic equations that arise from discretizations of elliptic problems by finite elements. We will only consider problems in three dimensions. Several new variants of the basic alg ..."
Abstract

Cited by 79 (17 self)
 Add to MetaCart
. Several domain decomposition methods of NeumannNeumann type are considered for solving the large linear systems of algebraic equations that arise from discretizations of elliptic problems by finite elements. We will only consider problems in three dimensions. Several new variants of the basic algorithm are introduced in a Schwarz method framework that provides tools which have already proven very useful in the design and analysis of other domain decomposition and multilevel methods. The NeumannNeumann algorithms have several advantages over other domain decomposition methods. The subregions, which define the subproblems, only share the boundary degrees of freedom with their neighbors. The subregions can also be of quite arbitrary shape and many of the major components of the preconditioner can be constructed from subprograms available in standard finite element program libraries. However, in its original form, the algorithm lacks a mechanism for global transportation of informatio...
A comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems
 Numer. Linear Algebra Appl
, 1994
"... In recent years, competitive domaindecomposed preconditioned iterative techniques have beendeveloped for nonsymmetric elliptic problems. In these techniques, a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow e ective solution on par ..."
Abstract

Cited by 53 (13 self)
 Add to MetaCart
In recent years, competitive domaindecomposed preconditioned iterative techniques have beendeveloped for nonsymmetric elliptic problems. In these techniques, a large problem is divided into many smaller problems whose requirements for coordination can be controlled to allow e ective solution on parallel machines. Acentral question is how tochoose these small problems and how to arrange the order of their solution. Di erent speci cations of decomposition and solution order lead to a plethora of algorithms possessing complementary advantages and disadvantages. In this report we compare several methods, including the additive Schwarz algorithm, the classical multiplicative Schwarz algorithm, an accelerated multiplicative Schwarz algorithm, the tile algorithm, the CGK algorithm, the CSPD algorithm, and also the popular global ILUfamily of preconditioners, on some nonsymmetric or inde nite elliptic model problems discretized by nite di erence methods. The preconditioned problems are solved by the unrestarted GMRES method. A version of the accelerated multiplicative Schwarz method is a consistently good performer.
Overlapping Schwarz Methods On Unstructured Meshes Using NonMatching Coarse Grids
 Numer. Math
, 1996
"... . 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 ..."
Abstract

Cited by 49 (17 self)
 Add to MetaCart
. 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 nonnested 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 quasiuniform. 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 ...
Domain decomposition algorithms for indefinite elliptic problems
 SIAM J. Sci. Stat. Comput
, 1992
"... Iterative methods for linear systems of algebraic equations arising from the finite element discretization of nonsymmetric and indefinite elliptic problems are considered. Methods previously known to work well for positive definite, symmetric problems are extended to certain nonsymmetric problems, w ..."
Abstract

Cited by 48 (16 self)
 Add to MetaCart
Iterative methods for linear systems of algebraic equations arising from the finite element discretization of nonsymmetric and indefinite elliptic problems are considered. Methods previously known to work well for positive definite, symmetric problems are extended to certain nonsymmetric problems, which can also have some eigenvalues in the left half plane. We first consider an additive Schwarz method applied to linear, second order, symmetric or nonsymmetric, indefinite elliptic boundary value problems in two and three dimensions. An alternative linear system, which has the same solution as the original problem, is derived and this system is then solved by using GMRES, an iterative method of conjugate gradient type. In each iteration step, a coarse mesh finite element problem and a number of local problems are solved on small, overlapping subregions into which the original region is subdivided. We show that the rate of convergence is independent of the number of degrees of freedom and the number of local problems if the coarse mesh is fine enough. The performance of the method in two dimensions is illustrated by results of several numerical experiments. We also consider two other iterative method for solving the same class of elliptic problems in two dimensions. Using an observation of Dryja and Widlund, we show that the rate of convergence of certain iterative substructuring methods deteriorates only quite slowly when the local problems increase in size. A similar result is established for Yserentant’s hierarchical basis method.
A twolevel additive Schwarz preconditioner for nonconforming plate elements
 Numer. Math
, 1994
"... Abstract. Twolevel additive Schwarz preconditioners are developed for the nonconforming P1 finite element approximation of scalar secondorder symmetric positive definite elliptic boundary value problems, the Morley finite element approximation of the biharmonic equation, and the divergencefree no ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
Abstract. Twolevel additive Schwarz preconditioners are developed for the nonconforming P1 finite element approximation of scalar secondorder symmetric positive definite elliptic boundary value problems, the Morley finite element approximation of the biharmonic equation, and the divergencefree nonconforming P1 finite element approximation of the stationary Stokes equations. The condition numbers of the preconditioned systems are shown to be bounded independent of mesh sizes and the number of subdomains in the case of generous overlap. 1.
A nonoverlapping domain decomposition method for Maxwell’s equations in three dimensions
 SIAM J. Numer. Anal
"... 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 muc ..."
Abstract

Cited by 36 (10 self)
 Add to MetaCart
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.
Some Schwarz Methods For Symmetric And Nonsymmetric Elliptic Problems
 Fifth International Symposium on Domain Decomposition Methods for Partial Differential Equations
, 1992
"... . This paper begins with an introduction to additive and multiplicative Schwarz methods. A twolevel method is then reviewed and a new result on its rate of convergence is established for the case when the overlap is small. Recent results by Xuejun Zhang, on multilevel Schwarz methods, are formulat ..."
Abstract

Cited by 34 (2 self)
 Add to MetaCart
. This paper begins with an introduction to additive and multiplicative Schwarz methods. A twolevel method is then reviewed and a new result on its rate of convergence is established for the case when the overlap is small. Recent results by Xuejun Zhang, on multilevel Schwarz methods, are formulated and discussed. The paper is concluded with a discussion of recent joint results with XiaoChuan Cai on nonsymmetric and indefinite problems. Key Words. domain decomposition, Schwarz methods, finite elements, nonsymmetric and indefinite elliptic problems AMS(MOS) subject classifications. 65F10, 65N30 1. Introduction. Over the last few years, a general theory has been developed for the study of additive and multiplicative Schwarz methods. Many domain decomposition and certain multigrid methods can now be successfully analyzed inside this framework. Early work by P.L. Lions [23], [24] gave an important impetus to this effort. The additive Schwarz methods were then developed by Dryja and ...
Multiplicative Schwarz algorithms for some nonsymmetric and indefinite problems
 SIAM JOURNAL ON NUMERICAL ANALYSIS
, 1993
"... The classical Schwarz alternating method has recently been generalized in several directions. This effort has resulted in a number of new powerful domain decomposition methods for elliptic problems, in new insight into multigrid methods and in the development of a very useful framework for the anal ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
The classical Schwarz alternating method has recently been generalized in several directions. This effort has resulted in a number of new powerful domain decomposition methods for elliptic problems, in new insight into multigrid methods and in the development of a very useful framework for the analysis of a variety of iterative methods. Most of this work has focused on positive definite, symmetric problems. In this paper a general framework is developed for multiplicative Schwarz algorithms for nonsymmetric and indefinite problems. Several applications are then discussed including two and multilevel Schwarz methods and iterative substructuring algorithms. Some new results on additive Schwarz methods are also presented.