A preconditioned conjugate gradient method on a distributed memory multiprocessor

DOI10.1016/0893-9659(95)00029-PzbMath0828.65033OpenAlexW2076053591WikidataQ126975425 ScholiaQ126975425MaRDI QIDQ1894218

C. Corral, Rafael Bru, José Mas

Publication date: 16 January 1996

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(95)00029-p

zbMATH Keywords

preconditioned conjugate gradient methoddistributed memory multiprocessorpolynomial preconditionerSPD matrix

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)

Related Items (2)

On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors ⋮ Some notes on multisplitting methods and \(m\)-step preconditioners for linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Additive polynomial preconditions for parallel computers
• Polynomial Preconditioners for Conjugate Gradient Calculations
• m-Step Preconditioned Conjugate Gradient Methods
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
• Methods of conjugate gradients for solving linear systems

This page was built for publication: A preconditioned conjugate gradient method on a distributed memory multiprocessor