39 citations · 87 across the 16 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021
An iterative coordinate descent algorithm to compute sparse low-rank approximations
Cristian Rusu
In this paper, we describe a new algorithm to build a few sparse principal components from a given data matrix. Our approach does not explicitly create the covariance matrix of the…
math.NA2021★ 1 cited
An iterative Jacobi-like algorithm to compute a few sparse approximate eigenvectors
Cristian Rusu
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of…