arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.05050math.NAcs.NA
收藏

一种用于核矩阵的分层随机压缩方法

A hierarchical random compression method for kernel matrices

University of North Carolina at Charlotte(北卡罗来纳大学夏洛特分校);Southern Methodist University(南方卫理公会大学)

Duan Chen, Wei Cai

AI总结:

本文提出了一种用于快速核求和的分层随机压缩方法(HRCM),结合H矩阵的分层框架和随机采样技术,实现低秩压缩,具有O(N logN)复杂度,验证了方法在电静力和亥姆霍兹波核中的效率和精度。

摘要:

在本文中,我们提出了一种用于快速核求和的分层随机压缩方法(HRCM)。HRCM结合了H矩阵的分层框架和随机采样技术,用于远场交互核矩阵。我们证明了对远场核矩阵进行均匀列/行采样(给定采样大小),无需预计算昂贵的采样分布,即可实现低秩压缩,与矩阵大小无关,仅依赖源和目标位置的分离。此远场随机压缩技术在分层分解的每个层次上实现一般核矩阵,导致O(N logN)的随机压缩方法。包括HRCM的误差和复杂度分析。电静力和亥姆霍兹波核的数值结果验证了所提方法的效率和精度,与直接O(N^2)求和相比,在相对精度为千位数量级时表现优异。

英文摘要:

In this paper, we propose a hierarchical random compression method (HRCM) for kernel matrices in fast kernel summations. The HRCM combines the hierarchical framework of the H-matrix and a randomized sampling technique of the column and row spaces for far-field interaction kernel matrices. We show that a uniform column/row sampling (with a given sample size) of a far-field kernel matrix, with- out the need and associated cost to pre-compute a costly sampling distribution, will give a low-rank compression of such low-rank matrices, independent of the matrix sizes and only dependent on the separation of the source and target locations. This far-field random compression technique is then implemented at each level of the hierarchical decomposition for general kernel matrices, resulting in an O(N logN) random compression method. Error and complexity analysis for the HRCM are included. Numerical results for electrostatic and Helmholtz wave kernels have vali- dated the efficiency and accuracy of the proposed method with a cross-over matrix size, in comparison of direct O(N^2) summations, in the order of thousands for a 3-4 digits relative accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑