Year: 1996
Journal of Computational Mathematics, Vol. 14 (1996), Iss. 4 : pp. 383–386
Abstract
In this paper, we consider solving dense linear equations on Dawning1000 by using matrix partitioning technique. Based on this partitioning of matrix, we give a parallel block LU decomposition method. The efficiency of solving linear equations by different ways is analysed. The numerical results are given on Dawning1000. By running our parallel program, the best speed up on 32 processors is over 25.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1996-JCM-9246
Journal of Computational Mathematics, Vol. 14 (1996), Iss. 4 : pp. 383–386
Published online: 1996-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 4