Global ETD Search

Novel Fast Algorithms For Low Rank Matrix Approximation

Svadlenka, John TThe Graduate School and University Center of The City University of New York2021

<p>Recent advances in matrix approximation have seen an emphasis on randomization techniques in which the goal was to create a sketch of an input matrix. This sketch, a random submatrix of an input matrix, having much fewer rows or columns, still preserves its relevant features. In one of such …

cuny-grad Repository record for Novel Fast Algorithms For Low Rank Matrix Approximation (opens in a new tab)