The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory

DOI10.1016/0377-0427(88)90341-XzbMath0738.65027MaRDI QIDQ1813207

Ulrike Meier, Ahmed H. Sameh

Publication date: 25 June 1992

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

reduced systempreconditioningconjugate gradient methodfinite differenceparallel computersmultivector processorAlliant FX/8incomplete Cholesky preconditionerswell-structured sparse

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Finite difference methods for boundary value problems involving PDEs (65N06) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (1)

Numerical accuracy of a certain class of iterative methods for solving linear system

Cites Work

• Unnamed Item
• The block preconditioned conjugate gradient method on vector computers
• A survey of preconditioned iterative methods for linear systems of algebraic equations
• The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers
• Block Preconditioning for the Conjugate Gradient Method
• Polynomial Preconditioners for Conjugate Gradient Calculations
• Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
• A Vectorizable Variant of some ICCG Methods
• Methods of inverting tridiagonal matrices

This page was built for publication: The behavior of conjugate gradient algorithms on a multivector processor with a hierarchical memory