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.

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.
1993
Spaletta G.; Evans D.J.
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/880469
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 10
social impact