DocumentCode
2821377
Title
A log2n parallel algorithm for the determinant of a tridiagonal matrix
Author
Mahmood, A. ; Lynch, D.J. ; Philipp, L.D.
Author_Institution
Washington State Univ., Richland, WA, USA
fYear
1991
fDate
11-14 Jun 1991
Firstpage
3043
Abstract
A new parallel algorithm is presented for computing the determinant of a tridiagonal matrix. The algorithm is based on a divide-and-conquer strategy and has a parallel time complexity of O (log2n ). The algorithm is adaptive and the effect of the available number of processors on the computation time is studied on a simulated MIMD static dataflow machine
Keywords
computational complexity; determinants; digital arithmetic; matrix algebra; parallel algorithms; MIMD static dataflow machine; computation time; divide-and-conquer strategy; number of processors; parallel algorithm; time complexity; tridiagonal matrix; Concurrent computing; Equations; Joining processes; Matrices; Matrix decomposition; Parallel algorithms; Parallel machines; Power generation;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN
0-7803-0050-5
Type
conf
DOI
10.1109/ISCAS.1991.176005
Filename
176005
Link To Document