Preconditioned CG methods for sparse matrices on massively parallel machines

DOI10.1016/S0167-8191(97)00005-7zbMath0907.68027MaRDI QIDQ1391826

D. Massart

Publication date: 23 July 1998

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

conjugate gradient methodsparse matricesdata distributionreorderingpolynomial preconditioningdistributed memorycommunication schemeincomplete Cholesky preconditioningmassively parallel machine

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (8)

Multiple search direction conjugate gradient method I: methods and their propositions ⋮ Comparison of Krylov subspace methods with preconditioning techniques for solving boundary value problems ⋮ The block Hessenberg process for matrix equations ⋮ Multiple search direction conjugate gradient method II: theory and numerical experiments ⋮ Preconditioning strategies for vectorial finite element linear systems arising from phase-field models for fracture mechanics ⋮ Решение систем линейных уравнений при вычислении логарифмов в конечном простом поле ⋮ Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems ⋮ FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002)

This page was built for publication: Preconditioned CG methods for sparse matrices on massively parallel machines