Parallel algorithms of the Purcell method for direct solution of linear systems

摘要

In this paper, we first demonstrate that the classical Purcell's vector method when combined with row pivoting yields a consistently small growth factor in comparison to the well-known Gauss elimination method, the Gauss-Jordan method and the Gauss-Huard method with partial pivoting. We then present six parallel algorithms of the Purcell method that may be used for direct solution of linear systems. The algorithms differ in ways of pivoting and load balancing. We recommend algorithms Ⅴ and Ⅵ for their reliability and algorithms Ⅲ and Ⅳ for good load balance if local pivoting is acceptable. Some numerical results are presented.