Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods
From MaRDI portal
Publication:3165439
DOI10.1137/110838844zbMath1253.65041OpenAlexW1985263109MaRDI QIDQ3165439
Nathan Bell, Luke N. Olson, Steven Dalton
Publication date: 26 October 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5ad3c2a9365e189fe76616cefd59ab08408222c3
numerical examplesiterative methodsparallel algorithmgraphics processing unitsalgebraic multigrid methodslarge, sparse linear systems
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (25)
A GPU accelerated aggregation algebraic multigrid method ⋮ MGM: A Meshfree Geometric Multilevel Method for Systems Arising from Elliptic Equations on Point Cloud Surfaces ⋮ AmgX: A Library for GPU Accelerated Algebraic Multigrid and Preconditioned Iterative Methods ⋮ Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures ⋮ Simultaneous Computational and Data Load Balancing in Distributed-Memory Setting ⋮ Efficient Algebraic Multigrid Preconditioners on Clusters of GPUs ⋮ Algebraic Multigrid Using a Stencil–CSR Hybrid Format on GPUs ⋮ Toward Cost-Effective Reservoir Simulation Solvers on GPUs ⋮ A GPU-Accelerated Hybridizable Discontinuous Galerkin Method for Linear Elasticity ⋮ Architecting the finite element method pipeline for the GPU ⋮ Robust and adaptive multigrid methods: comparing structured and algebraic approaches ⋮ Accelerating algebraic multigrid solvers on NVIDIA GPUs ⋮ Reducing Communication Costs for Sparse Matrix Multiplication within Algebraic Multigrid ⋮ Optimizing Sparse Matrix—Matrix Multiplication for the GPU ⋮ A Dynamic Pattern Factored Sparse Approximate Inverse Preconditioner on Graphics Processing Units ⋮ ViennaCL---Linear Algebra Library for Multi- and Many-Core Architectures ⋮ Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication ⋮ AMGCL: an efficient, flexible, and extensible algebraic multigrid implementation ⋮ Preparing sparse solvers for exascale computing ⋮ Bucket-based multigrid preconditioner for solving pressure Poisson equation using a particle method ⋮ Optimized sparse approximate inverse smoothers for solving Laplacian linear systems ⋮ Operator Splitting and Finite Difference Schemes for Solving the EMI Model ⋮ Incompressible SPH (ISPH) with fast Poisson solver on a GPU ⋮ Accelerating iterative linear solvers using multiple graphical processing units ⋮ Pipelined Iterative Solvers with Kernel Fusion for Graphics Processing Units
Uses Software
This page was built for publication: Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods
