A parallel preconditioned block conjugate gradient method for solving large systems of linear equations on a MIMD supercomputer

DOI10.1016/0895-7177(90)90158-JzbMath0728.65025MaRDI QIDQ805145

Alberto Vidal-Ascon, Luis Vidal-Ascon, Perpetua Ruiz-Mostacero, Thomas Grace

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

conjugate gradient methodfast convergenceblock partitioningincomplete Cholesky factorizationlarge symmetric positive-definite systemMIMD supercomputerpreconditioning step

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Unnamed Item
• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
• Systolic algorithms
• Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method
• Partial Elimination
• The solution of sparse linear equations by the conjugate gradient method
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices

This page was built for publication: A parallel preconditioned block conjugate gradient method for solving large systems of linear equations on a MIMD supercomputer