An Optimal Two-Level Overlapping Domain Decomposition Method for Elliptic Problems in Two and Three Dimensions

  title={An Optimal Two-Level Overlapping Domain Decomposition Method for Elliptic Problems in Two and Three Dimensions},
  author={Xiao‐Chuan Cai},
  journal={SIAM J. Sci. Comput.},
The solution of linear systems of algebraic equations that arise from elliptic finite element problems is considered. A two-level overlapping domain decomposition method that can be viewed as a combination of the additive and multiplicative Schwarz methods is studied. This method combines the advantages of the two methods. It converges faster than the additive Schwarz algorithm and is more parallelizable than the multiplicative Schwarz algorithm, and works for general, not necessarily self… 

1. A Family of Overlapping Schwarz Algorithms for Nonsymmetric and Indefinite Elliptic Problems

  • Xiao‐Chuan Cai
  • Computer Science
    Domain-Based Parallelism and Problem Decomposition Methods in Computational Science and Engineering
  • 1995
A family of overlapping Schwarz preconditioned Krylov space iterative methods for solving elliptic boundary value problems with operators that are dominated by the self adjoint second order terms but need not be eitherSelf adjoint or de nite All algorithms discussed in this paper involve two levels of preconditionsing and one of the critical components is a global coarse grid problem.

Parallel domain decomposition preconditioning for the adaptive finite element solution of elliptic problems in three dimensions

A novel weakly overlapping two level additive Schwarz domain decomposition preconditioning algorithm is presented which is appropriate for the parallel finite element solution of elliptic partial differential equations in three dimensions and turns out to be more effective and robust than the original symmetric preconditionsing algorithm when applied to symmetric positive definite problems.

Schwarz Methods of Neumann-Neumann Type for Three-Dimensional Elliptic Finite Element Problems

Several domain decomposition methods of Neumann-Neumann type are considered for solving the large linear systems of algebraic equations that arise from discretizations of elliptic problems by finite

Robust Iterative Methods On Unstructured Meshes

Three multilevel iterative solvers of both domain decomposition and multigrid type are proposed and analyzed, allowing almost or fully black-box implementation and suggesting the potential of the methods for solving a much wider variety of problems than those covered by the current theory.

Iterative Solution of Elliptic Finite Element Problems on Partially Refined Meshes and the Effect of

An iterative substructuring method which is a variation of Smith's vertex space method by using the similar idea of the previous algorithm and a domain decomposition parallel preconditioning method, which is well suited for the computation of nite element solutions on multiprocessor computer architectures.

Parallel Domain Decomposition Methods for Stochastic Elliptic Equations

It is shown theoretically and experimentally that the Schwarz preconditioned recycling GMRES method is optimal for the entire family of linear systems.

Applications of a space decomposition method to linear and nonlinear elliptic problems

This work presents some space decomposition algorithms for a convex minimization problem. The algorithms has linear rate of convergence and the rate of convergence depends only on four constants. The

Two-Level Preconditioners For 2m'th Order Elliptic Finite Element Problems

It is shown that appropriate smoothers can be deened based on overlapping Schwarz methods and uniform preconditioning estimates are proved in the general case when the triangulations are only assumed to be shape regular but not necessarily quasiuniform.

Domain Decomposition Preconditioning for Discontinuous Galerkin Approximations of Convection-Diffusion Problems

A class of nonoverlapping Schwarz preconditioners for DG approximations of convection-diffusion equations is studied and it is demonstrated through numerical computations that the classical Schwarz convergence theory cannot be applied to explain theoretically the converge observed numerically.


This thesis develops efficient numerical solvers for partial differential equations, based on the combination of Krylov subspace methods, such as Flexible GMRES, with domain decomposition preconditioning and to extend the applicability of the developed technique to (overlapping) nonmatching grids.



Domain Decomposition Algorithms for Indefinite Elliptic Problems

This paper presents an additive Schwarz method applied to linear, second order, symmetric or nonsymmetric, indefinite elliptic boundary value problems in two and three dimensions, and shows the rate of convergence to be independent of the number of degrees of freedom and thenumber of local problems.

Iterative schemes for nonsymmetric and indefinite elliptic boundary value problems

This paper describes some simple and robust iterative schemes for nonsymmetric and indefinite elliptic boundary value problems based in the Sobolev space H ([Omega]) and require minimal hypotheses to develop algorithms utilizing a coarse-grid approximation.

A preconditioned GMRES method for nonsymmetric or indefinite problems

The generality of the theory allows us to apply any known preconditioners that were orginally designed for symmetric positive definite problems to nonsymmetric or indefinite problems, without losing the optimality that the original one has.

Variational Iterative Methods for Nonsymmetric Systems of Linear Equations

A class of iterative algorithms for solving systems of linear equations where the coefficient matrix is nonsymmetric with positive-definite symmetric part, modelled after the conjugate gradient method, are considered.

GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems

We present an iterative method for solving linear systems, which has the property of minimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from t...

Convergence estimates for product iterative methods with applications to domain decomposition

In this paper, we consider iterative methods for the solution of symmetric positive definite problems on a space % which are defined in terms of products of operators defined with respect to a number

Convergence estimates for product iterative methodswith applications to domain decomposition and multigrid

  • Math . Comp .

A p r econditioned GMRES method for nonsymmetric or indeenite problems

  • Math. Comp
  • 1992

A new class of iterative methods for nonsymmetric boundary value problems

  • SIAM J. Numer. Anal
  • 1992