Showing math.NAShow all
3 papers · 1 filter
math.NA2019
CUR Low Rank Approximation at Deterministic Sublinear Cost
Qi Luan, Victor Y. Pan, John Svadlenka
A matrix algorithm runs at {\em sublinear cost} if it uses much fewer memory cells and arithmetic operations than the input matrix has entries. Such algorithms are indispensable fo…
math.NA2019
Superfast Approximate Linear Least Squares Solution of a Highly Overdetermined Linear System of Equations
Qi Luan, Victor Y. Pan
With a high probability the Sarlos randomized algorithm of 2006 outputs a nearly optimal least squares solution of a highly overdeterminedlinear system of equations. We propose its…
math.NA2012
More on the Power of Randomized Matrix Computations
Victor Y. Pan, Guoliang Qian
A random matrix is likely to be well conditioned, and motivated by this well known property we employ random matrix multipliers to advance some fundamental matrix computations. Thi…