A parallel preconditioned block conjugate gradient method for solving large systems of linear equations on a MIMD supercomputer
DOI10.1016/0895-7177(90)90158-JzbMATH Open0728.65025MaRDI QIDQ805145FDOQ805145
Authors: Luis Vidal-Ascon, Thomas Grace, Perpetua Ruiz-Mostacero, Alberto Vidal-Ascon
Publication date: 1990
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Recommendations
conjugate gradient methodblock partitioningincomplete Cholesky factorizationfast convergencelarge symmetric positive-definite systemMIMD supercomputerpreconditioning step
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- The Use of Pre-conditioning in Iterative Methods for Solving Linear Equations with Symmetric Positive Definite Matrices
- Partial Elimination
- The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
- Influence of the Eigenvalue Spectrum on the Convergence Rate of the Conjugate Gradient Method
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- The solution of sparse linear equations by the conjugate gradient method
- Systolic algorithms
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: A parallel preconditioned block conjugate gradient method for solving large systems of linear equations on a MIMD supercomputer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805145)