Reducing Parallel Communication in Algebraic Multigrid through Sparsification

DOI10.1137/15M1026341zbMath1352.65102arXiv1512.04629MaRDI QIDQ2830618

Luke N. Olson, Jacob B. Schroder, Amanda Bienz, Robert Falgout, William D. Gropp

Publication date: 28 October 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.04629

zbMATH Keywords

algorithm; convergence; numerical example; parallel computation; multigrid; algebraic multigrid; large sparse linear systems; high performance computing; non-Galerkin multigrid

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs

65F10: Iterative numerical methods for linear systems

65Y05: Parallel numerical computation

65Y20: Complexity and performance of numerical algorithms

Related Items

Nonsymmetric Algebraic Multigrid Based on Local Approximate Ideal Restriction ($\ell$AIR), Preparing sparse solvers for exascale computing, A New Analytical Framework for the Convergence of Inexact Two-Grid Methods, Chronos: A General Purpose Classical AMG Solver for High Performance Computing, A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows, Nonsymmetric Reduction-Based Algebraic Multigrid, A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations, Parallelisation of selective algebraic multigrid for block-pressure-velocity system in OpenFOAM, Automated tuning for the parameters of linear solvers, On the Recursive Structure of Multigrid Cycles, A filter in constructing the preconditioner for solving linear equation systems of radiation diffusion problems, A two-scale approach for efficient on-the-fly operator assembly in massively parallel high performance multigrid codes, A supplementary strategy for coarsening in algebraic multigrid, Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution

Uses Software

• BoomerAMG
• hypre
• HPCC
• PyAMG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse matrix approximations for multigrid methods
• Black box multigrid for nonsymmetric problems
• Black box multigrid
• \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
• Non-Galerkin Coarse Grids for Algebraic Multigrid
• On the Performance of an Algebraic Multigrid Solver on Multicore Clusters
• A new perspective on strength measures in algebraic multigrid
• On long-range interpolation operators for aggressive coarsening
• Collocation Coarse Approximation in Multigrid
• Parallel coarse-grid selection
• Non-Galerkin Multigrid Based on Sparsified Smoothed Aggregation
• Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
• Distance‐two interpolation for parallel algebraic multigrid
• Multigrid Methods for Variational Problems
• A general framework for graph sparsification
• Reducing Complexity in Parallel Algebraic Multigrid Preconditioners
• Graph Sparsification by Effective Resistances