Solving separable elliptic equations by the block stride reduction algorithm

Abstract

A comparison of the Buneman version of the block cyclic reduction (BCR) algorithm and Stride Reduction (BSR) based on polynomial factorization for separable elliptic equations with Dirichlet boundary conditions is presented. This study was initiated by an interest in the parallel computing techniques that can be used to increase the computational efficiency of these model problems

Keywords:

• Cyclic/Odd Even Reduction
• Stride Reduction
• Separable Elliptic Equation