Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalization

DOI10.1016/j.jcp.2006.04.012zbMath1106.65024OpenAlexW2254649540MaRDI QIDQ856383

Bill Poirier, Wenwu Chen

Publication date: 7 December 2006

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2006.04.012

zbMATH Keywords

numerical examplesiterative methodsparallel computingsparse matrixeigensolver

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)

Related Items (3)

Efficient implementation of the Lanczos method for magnetic systems ⋮ Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix-vector products ⋮ On the subspace projected approximate matrix method.

This page was built for publication: Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalization