Using Random Butterfly Transformations in parallel schur complement-based preconditioning

We propose to use a randomization technique based on Random Butterfly Transformations (RBT) in the Algebraic Recursive Multilevel Solver (ARMS) to improve the preconditioning phase in the iterative solution of sparse linear systems. We integrated the RBT technique into the parallel version of ARMS (pARMS). The preliminary experimental results on some matrices from the Davis´ collection show an improvement of the convergence and accuracy of the results when compared with existing implementations of the pARMS preconditioner.