60 citations · 234 across the 39 of their papers we have counts for
4 papers · 1 filter
Accurate principal component analysis via a few iterations of alternating least squares
Arthur Szlam, Andrew Tulloch, Mark Tygert
A few iterations of alternating least squares with a random starting point provably suffice to produce nearly optimal spectral- and Frobenius-norm accuracies of low-rank approximat…
A fast randomized algorithm for orthogonal projection
Vladimir Rokhlin, Mark Tygert
We describe an algorithm that, given any full-rank matrix A having fewer rows than columns, can rapidly compute the orthogonal projection of any vector onto the null space of A, as…
Fast algorithms for spherical harmonic expansions, III
Mark Tygert
We accelerate the computation of spherical harmonic transforms, using what is known as the butterfly scheme. This provides a convenient alternative to the approach taken in the sec…
A fast algorithm for computing minimal-norm solutions to underdetermined systems of linear equations
Mark Tygert
We introduce a randomized algorithm for computing the minimal-norm solution to an underdetermined system of linear equations. Given an arbitrary full-rank m x n matrix A with m<n,…