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

DOI10.1016/0167-8191(89)90062-8zbMath0679.65020OpenAlexW2082007415MaRDI 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

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (20)

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

This page was built for publication: On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy