当前位置: X-MOL 学术SIAM J. Matrix Anal. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Analytical Low-Rank Compression via Proxy Point Selection
SIAM Journal on Matrix Analysis and Applications ( IF 1.5 ) Pub Date : 2020-01-01 , DOI: 10.1137/19m1247838
Xin Ye , Jianlin Xia , Lexing Ying

It has been known in potential theory that, for some kernels matrices corresponding to well-separated point sets, fast analytical low-rank approximation can be achieved via the use of proxy points. This proxy point method gives a surprisingly convenient way of explicitly writing out approximate basis matrices for a kernel matrix. However, this elegant strategy is rarely known or used in the numerical linear algebra community. It still needs clear algebraic understanding of the theoretical background. Moreover, rigorous quantifications of the approximation errors and reliable criteria for the selection of the proxy points are still missing. In this work, we use contour integration to clearly justify the idea in terms of a class of important kernels. We further provide comprehensive accuracy analysis for the analytical compression and show how to choose nearly optimal proxy points. The analytical compression is then combined with fast rank-revealing factorizations to get compact low-rank approximations and also to select certain representative points. We provide the error bounds for the resulting overall low-rank approximation. This work thus gives a fast and reliable strategy for compressing those kernel matrices. Furthermore, it provides an intuitive way of understanding the proxy point method and bridges the gap between this useful analytical strategy and practical low-rank approximations. Some numerical examples help to further illustrate the ideas.

中文翻译:

通过代理点选择的分析性低秩压缩

在势论中已经知道,对于一些对应于分离良好的点集的核矩阵,可以通过使用代理点来实现快速解析低秩逼近。这种代理点方法提供了一种显式写出核矩阵的近似基矩阵的非常方便的方法。然而,这种优雅的策略在数值线性代数社区中很少为人所知或使用。它仍然需要对理论背景有清晰的代数理解。此外,仍然缺少近似误差的严格量化和选择代理点的可靠标准。在这项工作中,我们使用轮廓积分来根据一类重要内核清楚地证明该想法的合理性。我们进一步为解析压缩提供了全面的精度分析,并展示了如何选择近乎最优的代理点。然后将分析压缩与快速秩揭示分解相结合,以获得紧凑的低秩近似值,并选择某些代表性点。我们提供了由此产生的整体低秩近似的误差界限。因此,这项工作为压缩这些核矩阵提供了一种快速可靠的策略。此外,它提供了一种理解代理点方法的直观方式,并弥合了这种有用的分析策略与实用的低秩近似之间的差距。一些数值示例有助于进一步说明这些想法。然后将分析压缩与快速秩揭示分解相结合,以获得紧凑的低秩近似值,并选择某些代表性点。我们提供了由此产生的整体低秩近似的误差界限。因此,这项工作为压缩这些核矩阵提供了一种快速可靠的策略。此外,它提供了一种理解代理点方法的直观方式,并弥合了这种有用的分析策略与实用的低秩近似之间的差距。一些数值示例有助于进一步说明这些想法。然后将分析压缩与快速秩揭示分解相结合,以获得紧凑的低秩近似值,并选择某些代表性点。我们提供了由此产生的整体低秩近似的误差界限。因此,这项工作为压缩这些核矩阵提供了一种快速可靠的策略。此外,它提供了一种理解代理点方法的直观方式,并弥合了这种有用的分析策略与实用的低秩近似之间的差距。一些数值示例有助于进一步说明这些想法。它提供了一种理解代理点方法的直观方式,并弥合了这种有用的分析策略与实用的低秩近似之间的差距。一些数值示例有助于进一步说明这些想法。它提供了一种理解代理点方法的直观方式,并弥合了这种有用的分析策略与实用的低秩近似之间的差距。一些数值示例有助于进一步说明这些想法。
更新日期:2020-01-01
down
wechat
bug