A Fast Parallel Tridiagonal Algorithm for a Class of CFD Applications
Sun Xian-He, Stuti Moitra · NASA Technical Reports Server (NASA) · 1996
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. 2 proposed algorithm and other existing algorithms, and of the two parallel platforms are also discussed in this section. Section 6 provides concluding remarks. 2.0. Parallel Diagonal Dominant (PDD) Algorithm A tridiagonal system is a linear system of equations (1) where x = (x 1 , ..., x n ) T and d = (d 1 , ..., d n ) T are ...