Abstract
The paper considers the problem of constructing an efficient automatic procedure for reducing the block size in the block conjugate gradient method insuring that the resulting rate of convergence is comparable with that of the block conjugate gradient method with constant block size. The numerical results provided show that, independently of the type of distribution of the smallest eigenvalues of the preconditioned matrix, the procedure suggested always leads to a decrease of the arithmetic costs with respect to those of the block method with constant block size. Bibliography: 8 titles.
Similar content being viewed by others
REFERENCES
T. Davis, “Sparse matrix collection," http://www.cise.ufl.edu/~davis/sparse, University of Florida, June 1997.
Z. Dostál, “Conjugate gradient method with preconditioning by projector," Int. J. Comput. Math., 32, 315–323 (1988).
C. R. Kouhia, Personal communication.
L. Yu. Kolotilina and A. Yu. Yeremin, “Factorized sparse approximate inverse preconditionings. I. Theory," SIAM J. Matrix Anal. Appl., 14, 45–58 (1993).
“Matrix Market sparse matrix collection," National Institute of Standards and Technology, http:// www.nistgov/MatrixMarket, 2000.
M. Neytcheva, Personal communication.
A. A. Nikishin and A. Yu. Yeremin, “Variable block CG algorithms for solving large sparse symmetric positive definite linear systems on parallel computers, I: General iterative scheme," SIAM J. Matrix Anal. Appl., 16(4), 857–877 (1995).
C. C. Paige, The Computation of Eigenvalues of Very Large Sparse Matrices, Ph.D. Thesis, The University of London (1971).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nikishin, A.A., Yeremin, A.Y. An Automatic Procedure for Updating the Block Size in the Block Conjugate Gradient Method for Solving Linear Systems. Journal of Mathematical Sciences 114, 1844–1853 (2003). https://doi.org/10.1023/A:1022462721147
Issue Date:
DOI: https://doi.org/10.1023/A:1022462721147