Comparison of performance of three parallel versions of the block cyclic reduction algorithm for solving linear elliptic partial differential equations
Three versions of the block cyclic reduction (BCR) algorithm based on (a) polynomial factorization, (b) partial fraction expansion, and (c) rational approximations are presented to solve discrete version of the linear elliptic partial differential equations. Each of these versions is implemented using (a) the vector-oriented LU decomposition method, and (b) the scalar cyclic reduction method. Numerical comparison of the performance when solving standard Poisson's equation on the Alliant multivector processor is given.
scientific article; zbMATH DE number 109018
scientific article