On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms.
Casper Benjamin FreksenKasper Green LarsenPublished in: ISAAC (2017)
Keyphrases
- johnson lindenstrauss
- least squares
- systems of linear equations
- discrete fourier transform
- fourier transform
- singular value decomposition
- high dimensional
- coefficient matrix
- data matrix
- linear complementarity problem
- clustering algorithm
- image processing
- iterative methods
- pairwise comparison
- linear systems
- low rank
- kronecker product
- multiresolution