A log/sub 2/n parallel algorithm for the determinant of a tridiagonal matrix

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(log/sub 2/n). 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.<<ETX>>

[1]  B. S. Garbow,et al.  Matrix Eigensystem Routines — EISPACK Guide , 1974, Lecture Notes in Computer Science.

[2]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[3]  Thomas Kailath,et al.  Linear Systems , 1980 .

[4]  Curtis F. Gerald.  Applied numerical analysis , 1970 .

[5]  Gene H. Golub,et al.  Matrix computations , 1983 .