DIVIDE-AND-CONQUER METHODS FOR BLOCK TRIDIAGONAL SYSTEMS

被引：12

作者：

MEHRMANN, V

机构：

[1] Fakultät für Mathematik, Universität Bielefeld, D-4800 Bielefeld 1

来源：

PARALLEL COMPUTING | 1993年 / 19卷 / 03期

关键词：

LINEAR ALGEBRA; DIVIDE AND CONQUER METHOD; BLOCK-TRIDIAGONAL LINEAR SYSTEMS; MAXIMAL RANK DECOUPLING; DOMAIN DECOMPOSITION;

D O I：

10.1016/0167-8191(93)90037-L

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider the parallelization of numerical methods for the solution of block-tridiagonal linear systems. A general partitioning approach is discussed that allows to distribute the system in different ways on p processors using a divide and conquer approach based on low rank modifications. An analysis of the numerical properties and the preservation of structure during the method is given and some known special cases of this method are discussed.

引用

页码：257 / 279

页数：23

共 34 条

[1]

Ascher U., 1988, NUMERICAL SOLUTION B

[2]

Axelsson O, 1984, COMPUTER SCI APPL MA

[3]

Berman A, 1979, MATH SCI CLASSICS AP, V9, DOI DOI 10.1137/1.9781611971262

[4]

Birkhoff G., 1984, NUMERICAL SOLUTION E

[5] ITERATIVE METHODS FOR THE SOLUTION OF ELLIPTIC PROBLEMS ON REGIONS PARTITIONED INTO SUBSTRUCTURES [J].

BJORSTAD, PE ;

WIDLUND, OB .

SIAM JOURNAL ON NUMERICAL ANALYSIS, 1986, 23 (06) :1097-1120

[6]

BONDELI S, 1991, THESIS ETH ZURICH ZU

[7]

Bondeli Stefan, 1990, DIVIDE CONQUER NEW P

[8]

Concus P., 1976, STANCS76533

[9]

Dongarra J., 1987, SIAM J SCI STAT COMP, V8, P139

[10]

ELSNER L, 1992, IN PRESS J NUM LIN A

← 1 2 3 4 →