24 citations · 24 across the 6 of their papers we have counts for
6 papers · 1 filter
Experimental Evaluation of Multiprecision Strategies for GMRES on GPUs
Jennifer A. Loe, Christian A. Glusa, Ichitaro Yamazaki +2
Support for lower precision computation is becoming more common in accelerator hardware due to lower power usage, reduced data movement and increased computational performance. How…
Low-Synch Gram-Schmidt with Delayed Reorthogonalization for Krylov Solvers
Daniel Bielich, Julien Langou, Stephen Thomas +3
The parallel strong-scaling of Krylov iterative methods is largely determined by the number of global reductions required at each iteration. The GMRES and Krylov-Schur algorithms e…
Polynomial Preconditioned GMRES to Reduce Communication in Parallel Computing
Jennifer A. Loe, Heidi K. Thornquist, Erik G. Boman
Polynomial preconditioning with the GMRES minimal residual polynomial has the potential to greatly reduce orthogonalization costs, making it useful for communication reduction. We…
An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations
Léopold Cambier, Chao Chen, Erik G Boman +3
We propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND -- sparsified Nested Dissection. It is based on nested dissecti…
Asynchronous One-Level and Two-Level Domain Decomposition Solvers
Christian Glusa, Paritosh Ramanan, Erik G. Boman +2
Parallel implementations of linear iterative solvers generally alternate between phases of data exchange and phases of local computation. Increasingly large problem sizes on more h…
A distributed-memory hierarchical solver for general sparse linear systems
Chao Chen, Hadi Pouransari, Sivasankaran Rajamanickam +2
We present a parallel hierarchical solver for general sparse linear systems on distributed-memory machines. For large-scale problems, this fully algebraic algorithm is faster and m…