Preparing sparse solvers for exascale computing

DOI10.1098/rsta.2019.0053zbMath1462.65043OpenAlexW3000323728WikidataQ92754256 ScholiaQ92754256MaRDI QIDQ4993505

Rob Falgout, Michael A. Heroux, Pieter Ghysels, Hartwig Anzt, Lois Curfman McInnes, Xiaoye Li, Ichitaro Yamazaki, Karl Rupp, Richard Tran Mills, Sivasankaran Rajamanickam, Erik G. Boman, Barry F. Smith, Ulrike Meier Yang

Publication date: 15 June 2021

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://escholarship.org/uc/item/0r56p10n

zbMATH Keywords

softwarecomputational mathematicssparse solversmathematical librariescomputer modelling and simulation

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical algorithms for specific classes of architectures (65Y10)

Related Items

Two Physics-Based Schwarz Preconditioners for Three-Temperature Radiation Diffusion Equations in High Dimensions, Scalable preconditioning for the stabilized contact mechanics problem, Adaptively restarted block Krylov subspace methods with low-synchronization skeletons, AMG Preconditioners for Linear Solvers towards Extreme Scale, Algebraic Multigrid Block Preconditioning for Multi-Group Radiation Diffusion Equations

Cites Work

• Unnamed Item
• Unnamed Item
• Updating incomplete factorization preconditioners for model order reduction
• A fast adaptive solver for hierarchically semiseparable representations
• A parallel multigrid method using the full domain partition
• An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
• A New Paradigm for Parallel Adaptive Meshing Algorithms
• Reducing Parallel Communication in Algebraic Multigrid through Sparsification
• ViennaCL---Linear Algebra Library for Multi- and Many-Core Architectures
• Non-Galerkin Coarse Grids for Algebraic Multigrid
• Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods
• ParILUT---A New Parallel Threshold ILU Factorization
• Algebraic Multigrid Domain and Range Decomposition (AMG-DD/AMG-RD)
• An overview of the Trilinos project
• Distance‐two interpolation for parallel algebraic multigrid
• A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations
• Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction
• Fine-Grained Parallel Incomplete LU Factorization
• Communication Avoiding ILU0 Preconditioner
• Improving Multifrontal Methods by Means of Block Low-Rank Representations
• A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization
• A low‐communication, parallel algorithm for solving PDEs based on range decomposition
• Reducing communication in algebraic multigrid using additive variants