Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix-vector products
DOI10.1016/j.jpdc.2010.03.008zbMath1233.65028OpenAlexW1989208775MaRDI QIDQ666174
Publication date: 7 March 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.03.008
preconditioningparallel computingsparse matrixeigensolverlinear solverblock Jacobi matrixchemical physicsvector product
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)
Cites Work
- Unnamed Item
- Efficient index set generation for compiling HPF array statements on distributed-memory machines.
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalization
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. II: QMR linear solver
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Contention-free communication scheduling for array redistribution
- Improving communication scheduling for array redistribution
- Data redistribution and remote method invocation for coupled components
- Towards a fast parallel sparse symmetric matrix-vector multiplication
This page was built for publication: Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix-vector products
