A performance model for Krylov subspace methods on mesh-based parallel computers
From MaRDI portal
Publication:672104
DOI10.1016/0167-8191(95)00057-7zbMath0873.65017MaRDI QIDQ672104
Publication date: 27 February 1997
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(95)00057-7
iterative methods; sparse matrix; linear algebra; linear systems of equations; distributed memory multiprocessors; krylov subspace method
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65Y05: Parallel numerical computation
Related Items
Multiple search direction conjugate gradient method II: theory and numerical experiments, Multiple search direction conjugate gradient method I: methods and their propositions, Improved QMRCGSTAB method in distributed parallel environments, Conjugate residual squared method and its improvement for non-symmetric linear systems, An improved bi-conjugate residual algorithm suitable for distributed parallel computing, An improved GBPi-CG algorithm suitable for distributed parallel computing, An improved parallel hybrid bi-conjugate gradient method suitable for distributed parallel computing, Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers, Scalable algorithms for the solution of Navier's equations of elasticity, A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments, Minimizing synchronization in IDR (s ), Recent computational developments in Krylov subspace methods for linear systems
Uses Software
