The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers

DOI10.1016/0167-8191(86)90006-2zbMath0608.65021OpenAlexW2104119032MaRDI QIDQ1085948

Henk A. van der Vorst

Publication date: 1986

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(86)90006-2

zbMATH Keywords

scalingpreconditioned conjugate gradientsincomplete Cholesky factorizationvector computersCYBER 205CRAY 1CRAY XMPFORTRAN implementations

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Theory of operating systems (68N25)

Related Items

ICCG and related methods for 3D problems on vector computers, Practical use of the conjugate gradient method on parallel supercomputers, A block preconditioned conjugate gradient method for solving high-order finite element matrix equations, Inexact Newton methods on a vector supercomputer, TRANSPOSE-FREE LANCZOS-TYPE SCHEMES ON TRANSPUTER NETWORK∗, On vectorizing the preconditioned generalized conjugate residual methods, A general approach to nonlinear FE compuations on shared-memory multiprocessors, Vectorizable preconditioners for elliptic difference equations in three space dimensions, The pgcr method for solving unsymmetric linear systems on a vector multiprocessor, A vectorizable variant of pgcr methods for unsymmetric linear systems, Approximate polynomial preconditionings applied to biharmonic equations, Data structures to vectorize CG algorithms for general sparsity patterns, The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory, Solving 3D block bidiagonal linear systems on vector computers