A Note On Estimating the Spectral Norm of A Matrix Efficiently

Abstract

We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matrix reconstruction which use random sampling.

References in corpus (1)

• Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound

Cited by in corpus (1)

• Certifying Numerical Decompositions of Compact Group Representations