![Sample our Bioscience journals, sign in here to start your access, Latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5925/TOC-Subject-Sample-2021-Bioscience.jpg"})
Abstract
A comparison of the performance of the Buneman's version of the block cyclic reduction (BCR) algorithm based on a) polynomial factorization and b) partial fraction expansion for separable elliptic equations with Dirichlet boundary conditions is presented. This study was initiated by an interest in mesoscale atmospheric modeling and the parallel computing techniques that can be used to increase the computational efficiency of these models. Examples cited are taken from the field of meteorology. Varying the numbering scheme during the discretization process of separable elliptic equations changes the form of the coefficient matrix. It was determined serendipitously that for certain classes of separable problems found in meteorology, choosing a particular numbering scheme can save computational time by allowing a Poisson solver to be used in place of a more computationally demanding separable solver. Timings are based on the University of Oklahoma's eight processor Alliant FX/80 computer.
1Acknowledgement: This research was supported in part by a grant from the Center for the Analysis and Prediction of Storms (CAPS) which is an NSF Science and Technology Center (STC) at the University of Oklahoma.
1Acknowledgement: This research was supported in part by a grant from the Center for the Analysis and Prediction of Storms (CAPS) which is an NSF Science and Technology Center (STC) at the University of Oklahoma.
Notes
1Acknowledgement: This research was supported in part by a grant from the Center for the Analysis and Prediction of Storms (CAPS) which is an NSF Science and Technology Center (STC) at the University of Oklahoma.