A Set of Conjugate Gradient Routines for Real and Complex Arithmetics
暂无分享,去创建一个
In this report we describe the implementations of the preconditioned conjugate gradient (CG) algorithm for both real and complex, single and double precision arithmetics suitable for serial, shared memory and distributed memory computers. For the sake of simplicity, flexibility and efficiency the CG solvers have been implemented using the reverse communication mechanism for the matrix-vector product, the preconditioning and the dot product computations. Finally the implemented stopping criterion is based on a normwise backward error. After a short presentation of the CG algorithm we give a detailed description of the user interface.
[1] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .
[2] Françoise Chaitin-Chatelin,et al. Lectures on finite precision computations , 1996, Software, environments, tools.
[3] Iain S. Duff,et al. Stopping Criteria for Iterative Solvers , 1992, SIAM J. Matrix Anal. Appl..
[4] Y. Saad,et al. Iterative solution of linear systems in the 20th century , 2000 .