THE PARALLEL RECURSIVE DECOUPLING ALGORITHM FOR SOLVING TRIDIAGONAL LINEAR-SYSTEMS

被引：10

作者：

SPALETTA, G

EVANS, DJ

机构：

[1] LOUGHBOROUGH UNIV TECHNOL,PARALLEL ALGORITHMS RES CTR,LOUGHBOROUGH LE11 3TU,LEICS,ENGLAND

[2] UNIV BOLOGNA,DIPARTIMENTO MATEMAT,I-40126 BOLOGNA,ITALY

来源：

PARALLEL COMPUTING | 1993年 / 19卷 / 05期

关键词：

LINEAR ALGEBRA; TRIDIAGONAL LINEAR SYSTEM; RECURSIVE DECOUPLING; 2X2; SUBMATRIX; RANK ONE UPDATE;

D O I：

10.1016/0167-8191(93)90006-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we describe a new tridiagonal equation solver, based on a rank-one updating strategy an the repeated partitioning of the system matrix into 2 x 2 submatrices. On this basis, a recursive decoupling method is developed [2,3], which operates on the tridiagonal linear system, enabling the solution to be expressed in explicit form and solved independently on a multiprocessor system. We will show, in fact, that the Recursive Decoupling method is intrinsically parallel and can be implemented as an efficient parallel algorithm.

引用

页码：563 / 576

页数：14