A parallel Cholesky algorithm for the solution of symmetric linear systems

R. R. Khazal and M. M. Chawla

International Journal of Mathematics and Mathematical Sciences, 2004, vol. 2004, 1-13

Abstract:

For the solution of symmetric linear systems, the classical Cholesky method has proved to be difficult to parallelize. In the present paper, we first describe an elimination variant of Cholesky method to produce a lower triangular matrix which reduces the coefficient matrix of the system to an identity matrix. Then, this elimination method is combined with the partitioning method to obtain a parallel Cholesky algorithm. The total serial arithmetical operations count for the parallel algorithm is of the same order as that for the serial Cholesky method. The present parallel algorithm could thus perform with efficiency close to 1 if implemented on a multiprocessor machine. We also discuss the existence of the parallel algorithm; it is shown that for a symmetric and positive definite system, the presented parallel Cholesky algorithm is well defined and will run to completion.

Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2004/510841.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2004/510841.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:510841

DOI: 10.1155/S0161171204202265

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().