Sparse matrix-vector multiply algorithm based on overlapping computation and communication and application in AMG

zbMATH Open1349.65682MaRDI QIDQ2993579FDOQ2993579

Authors: Lian Zhao, Yonghua Zhao, Xuebin Chi 

Publication date: 10 August 2016

Recommendations

• Reducing communication costs for sparse matrix multiplication within algebraic multigrid
• SparseX: a library for high-performance sparse matrix-vector multiplication on multicore platforms
• Reducing parallel communication in algebraic multigrid through sparsification
• A note on the vectorization of algebraic multigrid algorithms
• AMGCL: an efficient, flexible, and extensible algebraic multigrid implementation

zbMATH Keywords

parallel algorithmnumerical experimentsLaplace equationpre-processingalgebraic multigridsparse matrix-vector multiplicationdata storage formatK-cycle iteration

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05)

Cited In (4)

• Effect of GPU communication-hiding for SpMV using OpenACC
• 1.5D parallel sparse matrix-vector multiply
• Reducing communication costs for sparse matrix multiplication within algebraic multigrid
• Extension of the parallel sparse matrix vector product (SpMV) for the implicit coupling of PDEs on non-matching meshes

Uses Software

• hypre

This page was built for publication: Sparse matrix-vector multiply algorithm based on overlapping computation and communication and application in AMG

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993579)