Journal
JOURNAL OF COMPUTATIONAL PHYSICS
Volume 219, Issue 1, Pages 185-197Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcp.2006.04.012
Keywords
sparse matrix; preconditioning; block Jacobi; chemical physics; parallel computing; eigensolver; linear solver
Ask authors/readers for more resources
Linear systems in chemical physics often involve matrices with a certain sparse block structure. These can often be solved very effectively using iterative methods (sequence of matrix-vector products) in conjunction with a block Jacobi preconditioner [Numer. Linear Algebra Appl. 7 (2000) 715]. In a two-part series, we present an efficient parallel implementation, incorporating several additional refinements. The present study (paper I) emphasizes construction of the block Jacobi preconditioner matrices. This is achieved in a preprocessing step, performed prior to the subsequent iterative linear solve step, considered in a companion paper (paper II). Results indicate that the block Jacobi routines scale remarkably well on parallel computing platforms, and should remain effective over tens of thousands of nodes. (c) 2006 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available