Bound for the L 2 norm of random matrix and succinct matrix approximation

Abstract

This work furnished a sharper bound of exponential form for the L 2 norm of an arbitrary shaped random matrix. Based on the newly elaborated bound, a non-uniform sampling method was developed to succinctly approximate a matrix with a sparse binary one and hereby to relieve the computation loads in both time and storage. This method is not only pass-efficient but query-efficient also since the whole process can be completed in one pass over the input matrix and the sampling and quantizing are naturally combined in a single step. © 2008 Springer-Verlag Berlin Heidelberg.