Efficient algorithms for cur and interpolative matrix decompositions
The manuscript describes efficient algorithms for the computation of the CUR and ID decompositions. The methods used are based on simple modifications to the classical truncated pivoted QR decomposition, which means that highly optimized library codes can be utilized for implementation. For certain...
Main Authors: | Voronin, S, Martinsson, P |
---|---|
Format: | Journal article |
Published: |
Springer US
2016
|
Similar Items
-
Accuracy and stability of CUR decompositions with oversampling
by: Park, T, et al.
Published: (2024) -
CUR decomposition for compression and compressed sensing of large-scale traffic data
by: Mitrovic, Nikola, et al.
Published: (2014) -
Low-rank approximation of parameter-dependent matrices via CUR decomposition
by: Park, T, et al.
Published: (2025) -
Shapes of a Suspended Curly Hair
by: Miller, J. T., et al.
Published: (2014) -
Directing curli polymerization with DNA origami nucleators
by: Mao, Xiuhai, et al.
Published: (2019)