Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Communication avoiding low rank approximation based on QR with tournament pivoting

Matthias Beaupère 1 Laura Grigori 1
1 ALPINES - Algorithms and parallel tools for integrated numerical simulations
INSMI - Institut National des Sciences Mathématiques et de leurs Interactions, Inria de Paris, LJLL (UMR_7598) - Laboratoire Jacques-Louis Lions
Abstract : We introduce a parallel algorithm for computing the low rank approximation $A_k$ of a large matrix $A$ which minimizes the number of messages exchanged between processors (modulo polylogarithmic factors) and has guarantees for the approximations of the singular values of $A$ provided by $A_k$. This operation is essential in many applications in scientific computing and data analysis when dealing with large data sets. Our algorithm is based on QR factorization that consists in selecting a subset of columns from the matrix $A$ that allow to approximate the range of $A$, and then projecting the columns of $A$ on a basis of the subspace spanned by those columns. The selection of columns is performed by using tournament pivoting, a strategy introduced previously for matrices partitioned into blocks of columns. This strategy is extended here to matrices partitioned along both dimensions that are distributed on a two-dimensional grid of processors, and also to tournaments with more general reduction trees. Performance results show that the algorithm scales well on up to $1024$ cores of $16$ nodes.
Document type :
Preprints, Working Papers, ...
Complete list of metadata
Contributor : Matthias Beaupère Connect in order to contact the contributor
Submitted on : Monday, January 18, 2021 - 3:06:26 PM
Last modification on : Friday, January 21, 2022 - 3:16:37 AM


Files produced by the author(s)


  • HAL Id : hal-02947991, version 2


Matthias Beaupère, Laura Grigori. Communication avoiding low rank approximation based on QR with tournament pivoting. 2021. ⟨hal-02947991v2⟩



Les métriques sont temporairement indisponibles