Performance of FORTRAN Implementations for Preconditioned Conjugate Gradients on Vector Computers.

摘要

The author considers in detail the performance of FORTRAN implementations for the conjugate gradient algorithm, for the solution of large linear systems, on a number of well-known vector computers: CRAY-1, CRAY X-MP, and CYBER 205. Lower bounds on the CPU-times, required for separate parts of the algorithm, are presented, and these are compared to the actually observed CPU-times. It appears that these lower bounds are reasonably sharp.