Domain decomposition algorithms for indefinite elliptic problems.

*(English)*Zbl 0746.65085Authors’ summary: 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.

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. 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. The rate of convergence is shown to be 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.

Two other iterative methods for solving the same class of elliptic problems in two dimensions is also considered. Using an observation of M. Dryja and the second author [Some domain decomposition algorithms (1989; Zbl 0703.68010)], it is shown 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 H. Yserentant’s hierarchical basis method [Computing 35, 39-49 (1985; Zbl 0566.65080)].

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. 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. The rate of convergence is shown to be 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.

Two other iterative methods for solving the same class of elliptic problems in two dimensions is also considered. Using an observation of M. Dryja and the second author [Some domain decomposition algorithms (1989; Zbl 0703.68010)], it is shown 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 H. Yserentant’s hierarchical basis method [Computing 35, 39-49 (1985; Zbl 0566.65080)].

Reviewer: S.F.McCormick (Denver)

##### MSC:

65N55 | Multigrid methods; domain decomposition for boundary value problems involving PDEs |

65F10 | Iterative numerical methods for linear systems |

65N30 | Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs |

35J25 | Boundary value problems for second-order elliptic equations |