通过CUR分解进行参数依赖矩阵的低秩近似
Low-rank approximation of parameter-dependent matrices via CUR decomposition
AI总结:
本文提出AdaCUR算法,通过CUR分解高效计算参数依赖矩阵的低秩近似,同时提供误差控制和竞争力复杂度。
摘要:
对参数依赖矩阵A(t)进行低秩近似是计算科学中的重要任务,例如在动力系统和图像序列压缩中出现。在本工作中,我们引入了AdaCUR,一种用于通过CUR分解计算参数依赖矩阵低秩近似的高效算法。该算法的关键思想是,对于相近的参数值,CUR分解的列和行索引往往可以重复使用。AdaCUR是基于秩的,提供误差控制,并且其复杂度与现有方法相比具有竞争力。此外,我们还给出了一个名为FastAdaCUR的更快算法,该算法优先考虑速度而非准确性,它也是基于秩的,其复杂度最多与行或列的数量成线性关系,但没有误差控制。
英文摘要:
A low-rank approximation of a parameter-dependent matrix $A(t)$ is an important task in the computational sciences appearing for example in dynamical systems and compression of a series of images. In this work, we introduce AdaCUR, an efficient algorithm for computing a low-rank approximation of parameter-dependent matrices via CUR decompositions. The key idea for this algorithm is that for nearby parameter values, the column and row indices for the CUR decomposition can often be reused. AdaCUR is rank-adaptive, provides error control, and has complexity that compares favorably against existing methods. A faster algorithm which we call FastAdaCUR that prioritizes speed over accuracy is also given, which is rank-adaptive and has complexity which is at most linear in the number of rows or columns, but without error control.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。