On the approximation of a matrix
share
Let F^* be an approximation of a given (a × b) matrix F derived by methods that are not randomized. We prove that for a given F and F^*, H and T can be computed by randomized algorithm such that (HT) is an approximation of F better than F^*.
READ FULL TEXT