A Comparison of Preconditioning Techniques for Parallelized PCG Solvers for the CCFD Problem

Richard Naff, John Wilson & Richard Naff
Parallel algorithms for solving sparse symmetric matrix systems that might result from the cell-centered finite difference (CCFD) scheme are compared. Parallelization is based in partitioning the mass matrix such that each partition is controlled by a separate process. These processes may then be distributed among a networked cluster of processors using the standard Message-Passing Interface (MPI). MPI software allows for multiple, simultaneous processes to coordinate and exchange information for some central purpose. In this study,...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.