Generalizing random butterfly transforms to arbitrary matrix sizes
Parker and Lê introduced random butterfly transforms (RBTs) as a preprocessing technique
to replace pivoting in dense LU factorization. Unfortunately, their FFT-like recursive structure …
to replace pivoting in dense LU factorization. Unfortunately, their FFT-like recursive structure …
A hybrid CPU/GPU approach for the parallel algebraic recursive multilevel solver pARMS
A Jamal, M Baboulin, A Khabou… - … on Symbolic and …, 2016 - ieeexplore.ieee.org
We illustrate how the distributed parallel Algebraic Recursive Multilevel Solver based on
MPI can be adapted for heterogeneous CPU/GPU architectures. The tasks performed on the …
MPI can be adapted for heterogeneous CPU/GPU architectures. The tasks performed on the …
Replacing pivoting in distributed Gaussian elimination with randomized techniques
N Lindquist, P Luszczek… - 2020 IEEE/ACM 11th …, 2020 - ieeexplore.ieee.org
Gaussian elimination is a key technique for solving dense, non-symmetric systems of linear
equations. Pivoting is used to ensure numerical stability but can introduce significant …
equations. Pivoting is used to ensure numerical stability but can introduce significant …
A parallel iterative solver for large sparse linear systems enhanced with randomization and GPU accelerator, and its resilience to soft errors
A Jamal - 2017 - theses.hal.science
In this PhD thesis, we address three challenges faced by linear algebra solvers in the
perspective of future exascale systems: accelerating convergence using innovative …
perspective of future exascale systems: accelerating convergence using innovative …