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.008zbMATH Open1233.65028OpenAlexW1989208775MaRDI QIDQ666174FDOQ666174
Authors: Wenwu Chen, Bill Poirier 
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
Recommendations
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. II: QMR linear solver
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalization
- Parallel sparse matrix multiplication for linear scaling electronic structure calculations
- scientific article; zbMATH DE number 2051077
- An efficient parallel preconditioned conjugate gradient method for sparse linear equations
- Parallel preconditioning of a sparse eigensolver
- Solving large sparse linear systems efficiently on Grid computers using an asynchronous iterative method as a preconditioner
- COMPARISONS OF THE PARALLEL PRECONDITIONERS FOR LARGE NONSYMMETRIC SPARSE LINEAR SYSTEMS ON A PARALLEL COMPUTER
- scientific article; zbMATH DE number 663839
- Iterative methods for solving sparse linear systems with a parallel preconditioner
sparse matrixpreconditioningeigensolverparallel computinglinear solverblock Jacobi matrixchemical physicsvector product
Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Title not available (Why is that?)
- Parallel implementation of efficient preconditioned linear solver for grid-based applications in chemical physics. I: Block Jacobi diagonalization
- Improving communication scheduling for array redistribution
- Contention-free communication scheduling for array redistribution
- Data redistribution and remote method invocation for coupled components
- Towards a fast parallel sparse symmetric matrix-vector multiplication
- 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. II: QMR linear solver
Cited In (2)
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666174)
