Reducing Communication Costs for Sparse Matrix Multiplication within Algebraic Multigrid
From MaRDI portal
Publication:2811988
DOI10.1137/15M1028807zbMath1339.65058OpenAlexW2410432900MaRDI QIDQ2811988
Christopher M. Siefert, Grey Ballard, Jonathan J. Hu
Publication date: 10 June 2016
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1028807
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
MGM: A Meshfree Geometric Multilevel Method for Systems Arising from Elliptic Equations on Point Cloud Surfaces ⋮ Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures ⋮ A Parallel Implementation of a Two-Level Overlapping Schwarz Method with Energy-Minimizing Coarse Space Based on Trilinos ⋮ A fast particle-based approach for calibrating a 3-D model of the Antarctic ice sheet ⋮ Performance of fully-coupled algebraic multigrid preconditioners for large-scale VMS resistive MHD
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A general parallel sparse-blocked matrix multiply for linear scaling SCF theory
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Optimizing Sparse Matrix—Matrix Multiplication for the GPU
- Simultaneous Input and Output Matrix Partitioning for Outer-Product--Parallel Sparse Matrix-Matrix Multiplication
- Multigrid Techniques
- Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods
- Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
- Sparse Matrix-Matrix Products Executed Through Coloring
- GPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row Merging
- An overview of the Trilinos project
- A Multigrid Tutorial, Second Edition
This page was built for publication: Reducing Communication Costs for Sparse Matrix Multiplication within Algebraic Multigrid
