Solving Large Sparse Linear Systems Efficiently on Grid Computers Using an Asynchronous Iterative Method as a Preconditioner

DOI10.1007/978-3-642-11795-4_27zbMath1216.65040MaRDI QIDQ3000135

Martin B. van Gijzen, Tijmen P. Collignon

Publication date: 18 May 2011

Published in: Numerical Mathematics and Advanced Applications 2009 (Search for Journal in Brave)

Full work available at URL: http://resolver.tudelft.nl/uuid:055261e4-bf75-44f1-91f0-87e95a9c24b3

zbMATH Keywords

iterative algorithm; numerical examples; preconditioning; large sparse linear systems; Grid computers

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65F10: Iterative numerical methods for linear systems

65Y10: Numerical algorithms for specific classes of architectures

65F08: Preconditioners for iterative methods

Related Items

Two implementations of the preconditioned conjugate gradient method on heterogeneous computing grids

Uses Software

• OmniRPC
• GridSolve
• Ninf-G/MPI
• Diet