Comparison of performance of three parallel versions of the block cyclic reduction algorithm for solving linear elliptic partial differential equations (Q1202489)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of performance of three parallel versions of the block cyclic reduction algorithm for solving linear elliptic partial differential equations |
scientific article |
Statements
Comparison of performance of three parallel versions of the block cyclic reduction algorithm for solving linear elliptic partial differential equations (English)
0 references
11 February 1993
0 references
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.
0 references
finite difference
0 references
block cyclic reduction algorithm
0 references
polynomial factorization
0 references
partial fraction expansion
0 references
rational approximations
0 references
LU decomposition method
0 references
cyclic reduction
0 references
performance
0 references
Poisson's equation
0 references
Alliant multivector processor
0 references
0 references
0 references
0 references
0 references
0 references
