SCHWARZ ALTERNATING AND ITERATIVE REFINEMENT METHODS FOR MIXED FORMULATIONS OF ELLIPTIC PROBLEMS .2. CONVERGENCE THEORY

被引：26

作者：

MATHEW, TP ^{[1
]}

机构：

[1] UNIV CALIF LOS ANGELES,DEPT MATH,LOS ANGELES,CA 90024

来源：

NUMERISCHE MATHEMATIK | 1993年 / 65卷 / 04期

关键词：

Mathematics Subject Classification (1991): 65F10; 65N30; 65N55;

D O I：

10.1007/BF01385763

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper we discuss bounds for the convergence rates of several domain decomposition algorithms to solve symmetric, indefinite linear systems arising from mixed finite element discretizations of elliptic problems. The algorithms include Schwarz methods and iterative refinement methods on locally refined grids. The implementation of Schwarz and iterative refinement algorithms have been discussed in part I. A discussion on the stability of mixed discretizations on locally refined grids is included and quantitative estimates for the convergence rates of some iterative refinement algorithms are also derived.

引用

页码：469 / 492

页数：24