Abstract
A new tridiagonal Toeplitz linear system (TTLS) solver is proposed. The solver first decomposes an n-dimensional strictly diagonally dominant TTLS equation into a number of m-dimensional subsystems employing a modified Gaussian elimination method. An analytic solution of a continued fraction is obtained to derive the solver. The solver based on the modified Gaussian elimination method fully exploits parallelism. Computation and communication complexities of the proposed algorithm are all shown to be O(n/m).
Original language | English |
---|---|
Pages (from-to) | 289-294 |
Number of pages | 6 |
Journal | Parallel Computing |
Volume | 13 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1990 Mar |
Externally published | Yes |
Keywords
- Parallel algorithm
- parallel computing
- real-time processing
- tridiagonal Toeplitz linear system solver
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Hardware and Architecture
- Computer Networks and Communications
- Computer Graphics and Computer-Aided Design
- Artificial Intelligence