loading...
Parallel Recursive Algorithm for Tridiagonal Systems
Shanghai, CHINA March 19-March 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/APDC.1997.5740221997 Advances in Parallel and Distrib ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yuguang Huang, Oxford University
In this paper, a parallel algorithm for solving tridiagonal equations based on recurrence is presented. Compared with the parallel prefix method (PP) which is also based on the recursive method, the computation cost is reduced by a factor of two whil maintaining the same communication cost. The method can be viewed as a modified prefix method or prefix with substructureing. The complexity of the algorithm is analysed using the BSP model (Bulk Synchronous Parallel). Experimental results are obtained on a Sun workstation using the Oxford BSP library.
Index Terms:
Tridiagonal Systems, Parallel Prefix Method, Recursive Method, Bulk Synchronous Parallel Model (BSP), Parallel Algorithms.
Citation:
Yuguang Huang, "Parallel Recursive Algorithm for Tridiagonal Systems," apdc, pp.124, 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.