Publication:
A parallel implementation of chebyshev preconditioned conjugate gradient method

Simple item page
dc.contributor.authorAkçadogan, Çagatay
dc.contributor.authorDag, Hasan
dc.date.accessioned2026-01-25T04:12:41Z
dc.date.issued2004-07-08
dc.description.abstractA parallel implementation for linear set of equations of the form Ax = b is presented in this paper. In this implementation, instead of the traditional direct solution of Ax = b, conjugate gradient method is used. The conjugate gradient method is accelerated with an approximate inverse matrix preconditioner obtained from a linear combination of matrix-valued Chebyshev polynomials. This implementation is tested on a Sun SMP machine. Since conjugate gradient method and preconditioner contain only matrix-vector and matrix-matrix multiplications, convincing results are obtained in terms of both speed and scalability.
dc.description.urihttps://doi.org/10.1109/ispdc.2003.1267636
dc.description.urihttps://doi.org/10.1109/ISPDC.2003.1267636
dc.description.urihttps://dx.doi.org/10.1109/ispdc.2003.1267636
dc.identifier.doi10.1109/ispdc.2003.1267636
dc.identifier.endpage8
dc.identifier.openairedoi_dedup___::5f128ac3e89645a257d9d09126ddff92
dc.identifier.orcid0000-0001-6252-1870
dc.identifier.startpage1
dc.identifier.urihttps://hdl.handle.net/11527/45098
dc.publisherIEEE
dc.relation.ispartofSecond International Symposium on Parallel and Distributed Computing, 2003. Proceedings.
dc.titleA parallel implementation of chebyshev preconditioned conjugate gradient method
dc.typeArticle
dspace.entity.typePublication

Files

Collections

Yayınlar