34 citations · 138 across the 34 of their papers we have counts for
Showing 2017 · cs.DCShow all
2 papers · 2 filters
cs.DC2017
Communication-avoiding Cholesky-QR2 for rectangular matrices
Edward Hutter, Edgar Solomonik
Scalable QR factorization algorithms for solving least squares and eigenvalue problems are critical given the increasing parallelism within modern machines. We introduce a more gen…
cs.DC2017
Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions
Edgar Solomonik, James Demmel, Torsten Hoefler
We introduce a new theoretical framework for deriving lower bounds on data movement in bilinear algorithms. Bilinear algorithms are a general representation of fast algorithms for…