.png){kind=icon}
.png){kind=icon}
Return
A DEIM INDUCED CUR FACTORIZATION
.png){kind=icon}
OA
AI
DOI：10.1137/140978430.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We derive a CUR approximate matrix factorization based on the discrete empirical interpolation method (DEIM). For a given matrix A, such a factorization provides a low-rank approximate decomposition of the form A approximate to CUR, where C and R are subsets of the columns and rows of A, and U is constructed to make CUR a good approximation. Given a low-rank singular value decomposition A approximate to VSWT, the DEIM procedure uses V and W to select the columns and rows of A that form C and R. Through an error analysis applicable to a general class of CUR factorizations, we show that the accuracy tracks the optimal approximation error within a factor that depends on the conditioning of submatrices of V and W. For very large problems, V and W can be approximated well using an incremental QR algorithm that makes only one pass through A. Numerical examples illustrate the favorable performance of the DEIM-CUR method compared to CUR approximations based on leverage scores.
Keywords:
discrete empirical interpolation method
CUR factorization
pseudoskeleton decomposition
low-rank approximation
one-pass QR decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W