109 citations · 261 across the 29 of their papers we have counts for
4 papers · 1 filter
Block subsampled randomized Hadamard transform for low-rank approximation on distributed architectures
Oleg Balabanov, Matthias Beaupere, Laura Grigori +1
This article introduces a novel structured random matrix composed blockwise from subsampled randomized Hadamard transforms (SRHTs). The block SRHT is expected to outperform well-kn…
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
Hussam Al Daas, Grey Ballard, Laura Grigori +2
Multiple Tensor-Times-Matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimen…
Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds
Hussam Al Daas, Grey Ballard, Laura Grigori +2
Communication lower bounds have long been established for matrix multiplication algorithms. However, most methods of asymptotic analysis have either ignored the constant factors or…
A Directional Equispaced interpolation-based Fast Multipole Method for oscillatory kernels
Igor Chollet, Xavier Claeys, Pierre Fortin +1
Fast Multipole Methods (FMMs) based on the oscillatory Helmholtz kernel can reduce the cost of solving N-body problems arising from Boundary Integral Equations (BIEs) in acoustic o…