Parallel implementation of an efficient preconditioned linear solver for grid-based applications in chemical physics. III: Improved parallel scalability for sparse matrix–vector products
Authors:
- Wenwu ChenWCWenwu Chen
- Bill PoirierBPBill Poirier
- 1 July 2010
- journal article
- research article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 70 (7) , 779-782
Abstract
No abstract availableKeywords
Funding Information
- Office of Advanced Scientific Computing Research, Mathematical, Information (D-1523)
- Computational Sciences Division of the US Department of Energy
- Welch Foundation
This publication has 16 references indexed in Scilit:
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. II: QMR linear solverJournal of Computational Physics, 2006
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalizationJournal of Computational Physics, 2006
- Data redistribution and remote method invocation for coupled componentsJournal of Parallel and Distributed Computing, 2006
- Improving communication scheduling for array redistributionJournal of Parallel and Distributed Computing, 2005
- Towards a fast parallel sparse symmetric matrix–vector multiplicationParallel Computing, 2001
- Contention-free communication scheduling for array redistributionParallel Computing, 2000
- A Framework for Generating Distributed-Memory Parallel Programs for Block Recursive AlgorithmsJournal of Parallel and Distributed Computing, 1996
- Compiling Array Expressions for Efficient Execution on Distributed-Memory MachinesJournal of Parallel and Distributed Computing, 1996
- A novel discrete variable representation for quantum mechanical reactive scattering via the S-matrix Kohn methodThe Journal of Chemical Physics, 1992
- QMR: a quasi-minimal residual method for non-Hermitian linear systemsNumerische Mathematik, 1991