Preconditioned CG methods for sparse matrices on massively parallel machines
From MaRDI portal
Publication:1391826
DOI10.1016/S0167-8191(97)00005-7zbMath0907.68027MaRDI QIDQ1391826
Publication date: 23 July 1998
Published in: Parallel Computing (Search for Journal in Brave)
conjugate gradient method; sparse matrices; data distribution; reordering; polynomial preconditioning; distributed memory; communication scheme; incomplete Cholesky preconditioning; massively parallel machine
68M99: Computer system organization
Related Items
FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002), Multiple search direction conjugate gradient method II: theory and numerical experiments, Unnamed Item, Multiple search direction conjugate gradient method I: methods and their propositions, Comparison of Krylov subspace methods with preconditioning techniques for solving boundary value problems