Iterative algorithms of domain decomposition for the solution of a quasilinear elliptic problem

被引：11

作者：

Boglaev, IP ^{[1
]}

机构：

[1] UNIV AUCKLAND,DEPT MATH,AUCKLAND,NEW ZEALAND

来源：

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | 1997年 / 80卷 / 02期

关键词：

elliptic problem; domain decomposition method; parallel computing;

D O I：

10.1016/S0377-0427(97)00032-0

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper deals with iterative algorithms for domain decomposition applied to the solution of a quasilinear elliptic problem. Two iterative algorithms are examined: the first one is the Schwarz alternating procedure and the second algorithm is suitable for parallel computing. Convergence results are established in the two-domain and multidomain decomposition cases. Some issues of parallel implementation of these algorithms are discussed.

引用

页码：299 / 316

页数：18

共 8 条

[1] THE SOLUTION OF SINGULARLY PERTURBED HUGE PROBLEMS VIA DOMAIN DECOMPOSITION [J].