A Parallel Algorithm for Solving Sparse Triangular Systems

Chin Wen Ho, R. C.T. Lee

研究成果: 雜誌貢獻期刊論文同行評審

3 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose a fast parallel algorithm, which is generalized from the parallel algorithms for solving banded linear systems, to solve sparse triangular systems. We transform the original problem 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(log2n) 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 our algorithm is O(log(m) log(n)).

原文???core.languages.en_GB???
頁(從 - 到)848-852
頁數5
期刊IEEE Transactions on Computers
39
發行號6
DOIs
出版狀態已出版 - 6月 1990

指紋

深入研究「A Parallel Algorithm for Solving Sparse Triangular Systems」主題。共同形成了獨特的指紋。

引用此