.png){kind=icon}
返回
A DEIM INDUCED CUR FACTORIZATION
.png){kind=icon}
OA
AI
DOI：10.1137/140978430.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
discrete empirical interpolation method
CUR factorization
pseudoskeleton decomposition
low-rank approximation
one-pass QR decomposition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Bacteria Associated with Red Imported Fire Ants (Solenopsis invicta) from Mounds in Mississippi
PREAI
分享收藏分享收藏A NEW SELECTION OPERATOR FOR THE DISCRETE EMPIRICAL INTERPOLATION METHOD-IMPROVED A PRIORI ERROR BOUND AND EXTENSIONS离散经验插值法的一种新的选择算子 -- 改进的先验误差界和扩展OAAI
OAAI分享收藏Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions.png)
SIAM REVIEW
OAAI
SIAM REVIEWIF6.1
OAAI分享收藏
查看更多内容