Overview

The parallel diagonal dominant (PDD) algorithm is an efficient tridiagonal solver. This paper presents for study a variation of the PDD algorithm, the reduced PDD algorithm. The new algorithm maintains the minimum communication provided by the PDD algorithm, but has a reduced operation count. The PDD algorithm also has a smaller operation count than the conventional sequential algorithm for many applications. Accuracy analysis is provided for the reduced PDD algorithm for symmetric Toeplitz tridiagonal (STT) systems. Implementation results on Langley's Intel Paragon and IBM SP2 show that both the PDD and reduced PDD algorithms are efficient and scalable. Moitra, Stuti and Sun, Xian-He Langley Research Center NASA-TP-3585, L-17510, NAS 1.60:3585 RTOP 509-10-24-01...

Full Product Details

9781724990082

Table of Contents

Reviews

Author Information

Tab Content 6

Countries Available