I will discuss recent algorithmic developments for the classical problem of approximating a given matrix by a low-rank matrix. This is motivated by the need of faster algorithms for very large data and certain applications that want the approximating matrix to have rows living in the span of only a few rows of the original matrix, which adds a c...
Creator:
Rademacher, Luis (The Ohio State University)
Created:
2011-09-28
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.