arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1509.07925math.NAcs.NA
收藏

多维蝴蝶分解

Multidimensional Butterfly Factorization

Stanford University(斯坦福大学);Duke University(杜克大学)

Yingzhou Li, Haizhao Yang, Lexing Ying

AI总结:

本文提出多维蝴蝶分解,用于表示满足互补低秩性质的多维核矩阵。该分解将N×N的核矩阵近似为O(logN)个稀疏矩阵的乘积,每个矩阵包含O(N)个非零元素,并提出高效算法以处理不同情况下的构造问题。

摘要:

本文提出多维蝴蝶分解,用于表示满足互补低秩性质的多维核矩阵。该分解将N×N的核矩阵近似为O(logN)个稀疏矩阵的乘积,每个矩阵包含O(N)个非零元素,并提出高效算法以处理不同情况下的构造问题。

英文摘要:

This paper introduces the multidimensional butterfly factorization as a data-sparse representation of multidimensional kernel matrices that satisfy the complementary low-rank property. This factorization approximates such a kernel matrix of size $N\times N$ with a product of $Ø(\log N)$ sparse matrices, each of which contains $Ø(N)$ nonzero entries. We also propose efficient algorithms for constructing this factorization when either (i) a fast algorithm for applying the kernel matrix and its adjoint is available or (ii) every entry of the kernel matrix can be evaluated in $Ø(1)$ operations. For the kernel matrices of multidimensional Fourier integral operators, for which the complementary low-rank property is not satisfied due to a singularity at the origin, we extend this factorization by combining it with either a polar coordinate transformation or a multiscale decomposition of the integration domain to overcome the singularity. Numerical results are provided to demonstrate the efficiency of the proposed algorithms.

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

↑