A Parallel Algorithm for Solving Sparse Triangular Systems

Authors:
C.-W. Ho;R. C. T. Lee
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1990

Citing 9
Cited 0

Vector computations for sparse linear systems

SIAM Journal on Algebraic and Discrete Methods
A Fast Direct Solution of Poisson's Equation Using Fourier Analysis

Journal of the ACM (JACM)
An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations

Journal of the ACM (JACM)
Odd-Even Reduction for Banded Linear Equations

Journal of the ACM (JACM)
A universal interconnection pattern for parallel computers

Journal of the ACM (JACM)
An Efficient General-Purpose Parallel Computer

Journal of the ACM (JACM)
Ultracomputers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallelism in random access machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Lu decomposition on a multiprocessing system with communications delay

Lu decomposition on a multiprocessing system with communications delay

Quantified Score

Hi-index	14.98

Visualization

Abstract

A fast parallel algorithm, which is generalized from the parallel algorithms for solving banded linear systems, is proposed to solve sparse triangular systems. The original problem is transformed into a directed graph. The solving procedure then consists of eliminating edges in this graph. The worst-case time-complexity of this parallel algorithm is O(log/sup 2/n) where n is the size of the coefficient matrix. When the coefficient matrix is a triangular banded matrix with bandwidth m, then the time-complexity of the algorithm is O(log(m)*log(n)).