Kavli Affiliate: David Gross | First 5 Authors: Tim Fuchs, David Gross, Felix Krahmer, Richard Kueng, Dustin G. Mixon | Summary: Given an arbitrary matrix $Ainmathbb{R}^{ntimes n}$, we consider the fundamental problem of computing $Ax$ for any $xinmathbb{R}^n$ such that $Ax$ is $s$-sparse. While fast algorithms exist for particular choices of $A$, such as the […]

Continue.. Sketching with Kerdock’s crayons: Fast sparsifying transforms for arbitrary linear maps