A ug 2 01 3 Relative Errors for Deterministic Low-Rank Matrix Approximations

We consider processing an n× d matrixA in a stream with row-wise updates according to a recent algorithm called Frequent Directions (Liberty, KDD 2013). This algorithm maintains an l× d matrixQ deterministically, processing each row in O(dl) time; the processing time can be decreased to O(dl) with a slight modification in the algorithm and a constant inc… (More)