On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy

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

zbMATH Keywords

numerical examples; parallel algorithms; preconditioned conjugate gradient method; multiprocessor system; incomplete Cholesky preconditionings; s-step conjugate gradient methods

Mathematics Subject Classification ID

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

The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology, Avoiding Communication in Primal and Dual Block Coordinate Descent Methods, Communication lower bounds and optimal algorithms for numerical linear algebra, The pgcr method for solving unsymmetric linear systems on a vector multiprocessor, Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision, Minimizing synchronizations in sparse iterative solvers for distributed supercomputers, A generalization of \(s\)-step variants of gradient methods, A convergence theorem for chaotic asynchronous relaxation, Implementation of an adaptive algorithm for Richardson's method, A parallel alternating direction implicit preconditioning method, s-step iterative methods for symmetric linear systems, Nonlinear CG-like iterative methods, An efficient nonsymmetric Lanczos method on parallel vector computers, Adaptive polynomial preconditioning for Hermitian indefinite linear systems, A Krylov multisplitting algorithm for solving linear systems of equations, Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation, A vectorizable variant of pgcr methods for unsymmetric linear systems