کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
522372 | 867824 | 2006 | 13 صفحه PDF | دانلود رایگان |
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.
Journal: Journal of Computational Physics - Volume 219, Issue 1, 20 November 2006, Pages 185–197