论文信息 - A preconditioned Conjugate Gradient Method on a distributed memory multiprocessor

A preconditioned Conjugate Gradient Method on a distributed memory multiprocessor

This paper discusses preconditioners for the Conjugate Gradient Method which are based on splittings of the system matrix. Conditions for the convergence are given, and particular splittings are chosen in order to implement the method on a distributed memory multiprocessor.

Rafael Bru | Cristina Corral | José Luis Verdú Más

[1] J. Ortega. Introduction to Parallel and Vector Solution of Linear Systems , 1988, Frontiers of Computer Science.

[2] L. Adams. m-Step Preconditioned Conjugate Gradient Methods , 1985 .

[3] Gene H. Golub,et al. Matrix computations , 1983 .

[4] Rafael Bru,et al. Multisplitting Preconditioners Based on Incomplete Choleski Factorizations , 1995, SIAM J. Matrix Anal. Appl..

[5] M. Hestenes,et al. Methods of conjugate gradients for solving linear systems , 1952 .

[6] C. Micchelli,et al. Polynomial Preconditioners for Conjugate Gradient Calculations , 1983 .

[7] Loyce M. Adams,et al. Additive polynomial preconditioners for parallel computers , 1989, Parallel Comput..