A Completely Parallelizable Algorithm for the Determinant of a Tridiagonal Matrix

CIT. Journal of Computing and Information Technology

J. Lynch, D.¹  Mahmood, A.¹  D. Philipp, L.¹ 

[1] School of Electrical Engineering and Computer Science, Washington State University at Tri-Cities, Richland, U.S.A.

关键词: Determinant;    Tridiagonal Matrix;    Parallel Algorithm;    MIMD;    PRAM;   

DOI  :  

学科分类：计算机科学（综合）

来源: Sveuciliste u Zagrebu

【 摘 要 】

A new parallel algorithm (MIMD-PRAM class) having parallel time complexity of log2 n for computing the determinant of a tridiagonal matrix is developed. The algorithm is based on coupling the determinants of two neighboring submatrix...

【 授权许可】

Unknown