On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms.
Casper Benjamin FreksenKasper Green LarsenPublished in: Algorithmica (2020)
Keyphrases
- johnson lindenstrauss
- least squares
- systems of linear equations
- discrete fourier transform
- singular value decomposition
- fourier transform
- high dimensional
- frequency domain
- condition number
- coefficient matrix
- linear algebra
- correlation matrix
- sparse matrix
- neural network
- data matrix
- singular values
- pairwise comparison
- covariance matrix
- missing values
- image coding
- information systems