By Topic

A log2n parallel algorithm for the determinant of a tridiagonal matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
A. Mahmood ; Washington State Univ., Richland, WA, USA ; D. J. Lynch ; L. D. Philipp

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

Published in:

Circuits and Systems, 1991., IEEE International Sympoisum on

Date of Conference:

11-14 Jun 1991