Length Bounds for Singular Values of Sparse Matrices.
Charles R. JohnsonPeter M. NylenPublished in: SIAM J. Matrix Anal. Appl. (1993)
Keyphrases
- singular values
- sparse matrices
- singular value decomposition
- linear algebra
- linear relaxation
- floating point
- upper bound
- low rank
- lower bound
- condition number
- least squares
- linear program
- minimum cost
- lower and upper bounds
- principal component analysis
- worst case
- total variation
- column generation
- rows and columns
- constant factor
- relaxation algorithm
- set partitioning