LEAST-SQUARES MIXED FINITE-ELEMENT METHODS FOR NONSELF-ADJOINT ELLIPTIC PROBLEMS .2. PERFORMANCE OF BLOCK-ILU FACTORIZATION METHODS

被引：24

作者：

CAREY, GF ^{[1
]}

PEHLIVANOV, AI ^{[1
]}

VASSILEVSKI, PS ^{[1
]}

机构：

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

来源：

SIAM JOURNAL ON SCIENTIFIC COMPUTING | 1995年 / 16卷 / 05期

关键词：

LEAST-SQUARES MIXED FINITE ELEMENTS; APPROXIMATE BLOCK FACTORIZATION; PRECONDITIONING; NONSELF-ADJOINT ELLIPTIC PROBLEMS;

D O I：

10.1137/0916065

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The least-squares mixed finite element technique developed in Part I is applied to non-selfadjoint second-order elliptic problems. This approach leads to a symmetric positive definite bilinear form which is coercive uniformly in the discretization parameter. In this paper we consider an approximate block-factorization technique recently proposed by Chan and Vassilevski in [A framework for block-ILU factorization using block size reduction, Math. Comp., 64 (1995), pp. 129-156] and which is well defined for positive definite block-tridiagonal matrices. The method is analyzed and supported with extensive numerical experiments.

引用

页码：1126 / 1136

页数：11

共 21 条

[1] ON APPROXIMATE FACTORIZATION METHODS FOR BLOCK MATRICES SUITABLE FOR VECTOR AND PARALLEL PROCESSORS [J].