On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
Publication:1822895
DOI10.1016/0167-8191(89)90062-8zbMath0679.65020MaRDI QIDQ1822895
C. William Gear, Anthony Theodore Chronopoulos
Publication date: 1989
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(89)90062-8
numerical examples; parallel algorithms; preconditioned conjugate gradient method; multiprocessor system; incomplete Cholesky preconditionings; s-step conjugate gradient methods
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
35J05: Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation
65N22: Numerical solution of discretized equations for boundary value problems involving PDEs
Related Items