In this paper we describe a new tridiagonal equation solver, based on a rank-one updating strategy and the repeated partitioning of the system matrix into 2 × 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. © 1993.
Spaletta G., Evans D.J. (1993). The parallel recursive decoupling algorithm for solving tridiagonal linear systems. PARALLEL COMPUTING, 19(5), 563-576 [10.1016/0167-8191(93)90006-7].
The parallel recursive decoupling algorithm for solving tridiagonal linear systems
Spaletta G.
Primo
;
1993
Abstract
In this paper we describe a new tridiagonal equation solver, based on a rank-one updating strategy and the repeated partitioning of the system matrix into 2 × 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. © 1993.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
