Parallel recursive algorithm for tridiagonal systems

descriptionPublicationkeyboard_double_arrow_right Article , Conference object , Other literature type 22 Nov 2002Publisher:IEEE Comput. Soc. PressJournal:Proceedings. Advances in Parallel and Distributed Computing

Authors: Yuguang Huang;

doi: 10.1109/apdc.1997.574022

Parallel recursive algorithm for tridiagonal systems

- Summary
- Metrics

Abstract

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 while maintaining the same communication cost. The method can be viewed as a modified prefix method or prefix with substructuring. 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.

Related Organizations

University of Oxford
United Kingdom

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average