We describe two recently proposed randomized algorithms for the construction of low-rank approximations to matrices, and demonstrate their application (inter alia) to the evaluation of the singular ...

A simulation study with three examples shows that the proposed quasi random algorithm provides much tighter estimates of the quantiles of the stationary distribution and is about 4-25 times as ...