448 citations · 1.8k across the 37 of their papers we have counts for
5 papers · 2 filters
Randomized algorithms for rounding in the Tensor-Train format
Hussam Al Daas, Grey Ballard, Paul Cazeaux +5
The Tensor-Train (TT) format is a highly compact low-rank representation for high-dimensional tensors. TT is particularly useful when representing approximations to the solutions o…
A Refined Probabilistic Error Bound for Sums
Eric Hallman
This paper considers a probabilistic model for floating-point computation in which the roundoff errors are represented by bounded random variables with mean zero. Using this model,…
A Multilevel Approach to Stochastic Trace Estimation
Eric Hallman, Devon Troester
This article presents a randomized matrix-free method for approximating the trace of , where is a large symmetric matrix and is a function analytic in a c…
A Block Bidiagonalization Method for Fixed-Accuracy Low-Rank Matrix Approximation
Eric Hallman
We present randUBV, a randomized algorithm for matrix sketching based on the block Lanzcos bidiagonalization process. Given a matrix , it produces a low-rank approximation…
Faster Stochastic Trace Estimation with a Chebyshev Product Identity
Eric Hallman
Methods for stochastic trace estimation often require the repeated evaluation of expressions of the form , where is a symmetric matrix and is a degree po…