Preparing sparse solvers for exascale computing

DOI10.1098/RSTA.2019.0053MaRDI QIDQ4993505zbMATH OpenOpenAlexWikidataFDO

Authors Hartwig Anzt, E. G. Boman, Rob Falgout, Pieter Ghysels, Michael A. Heroux, Xiaoye Li, L. C. McInnes, Richard Tran Mills, Sivasankaran Rajamanickam, Karl Rupp, Ichitaro Yamazaki, Barry 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

computational mathematicscomputer modelling and simulationmathematical librariessoftwaresparse solvers

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7366717
• PaStiX: A high-performance parallel direct solver for sparse symmetric positive definite systems
• New parallel sparse direct solvers for multicore architectures
• Analysis and comparison of two general sparse solvers for distributed memory computers
• Editorial: Algorithmic requirements for HPC

Cites work

• A distributed-memory package for dense hierarchically semi-separable matrix computations using randomization
• A fast adaptive solver for hierarchically semiseparable representations
• A low‐communication, parallel algorithm for solving PDEs based on range decomposition
• A new paradigm for parallel adaptive meshing algorithms
• A new parallel domain decomposition method for the adaptive finite element solution of elliptic partial differential equations
• A parallel multigrid method using the full domain partition
• Algebraic multigrid domain and range decomposition (AMG-DD/AMG-RD)
• An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
• An overview of the Trilinos project
• Communication Avoiding ILU0 Preconditioner
• Distance-two interpolation for parallel algebraic multigrid
• Exposing fine-grained parallelism in algebraic multigrid methods
• Fine-grained parallel incomplete LU factorization
• scientific article; zbMATH DE number 554618 (Why is no real title available?)
• Improving multifrontal methods by means of block low-rank representations
• Non-Galerkin coarse grids for algebraic multigrid
• Parallel iterative methods for sparse linear systems
• ParILUT---A New Parallel Threshold ILU Factorization
• Reducing communication in algebraic multigrid using additive variants.
• Reducing parallel communication in algebraic multigrid through sparsification
• Robust and accurate stopping criteria for adaptive randomized sampling in matrix-free hierarchically semiseparable construction
• Updating incomplete factorization preconditioners for model order reduction
• ViennaCL-linear algebra library for multi- and many-core architectures

Cited in

(8)

• Scalable preconditioning for the stabilized contact mechanics problem
• Exascale applications: skin in the game
• Two Physics-Based Schwarz Preconditioners for Three-Temperature Radiation Diffusion Equations in High Dimensions
• AMG Preconditioners for Linear Solvers towards Extreme Scale
• Algebraic multigrid block preconditioning for multi-group radiation diffusion equations
• Parallel hierarchical hybrid linear solvers for emerging computing platforms
• Adaptively restarted block Krylov subspace methods with low-synchronization skeletons
• Optimal polynomial smoothers for parallel AMG

This page was built for publication: Preparing sparse solvers for exascale computing

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