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.<
>