Second International Symposium on Parallel and Distributed Computing A Parallel Implementation of Chebyshev Preconditioned Conjugate Gradient Method Ljubljana, Slovenia October 13-October 14 ISBN: 0-7695-2069-3
A 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.
Citation:
?agatay Ak?adogan, Hasan Dag, "A Parallel Implementation of Chebyshev Preconditioned Conjugate Gradient Method," ispdc, pp.1, Second International Symposium on Parallel and Distributed Computing, 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||