一种用于压缩高维振荡积分算子的线性复杂度张量蝴蝶算法
A Linear-complexity Tensor Butterfly Algorithm for Compressing High-dimensional Oscillatory Integral Operators
AI总结:
本文提出张量蝴蝶算法,利用互补低秩性质的张量扩展,以线性复杂度$O(n^d)$压缩高维振荡积分算子,较现有算法实现200倍加速和30倍内存减少,并支持高达6维的FFT和拉东变换。
摘要:
本文提出了一种名为张量蝴蝶算法的多级张量压缩算法,用于高效表示大规模和高维振荡积分算子,包括波动方程的格林函数以及拉东变换和傅里叶变换等积分变换。该算法利用了现有矩阵蝴蝶算法所谓的互补低秩性质的张量扩展。算法将离散化的积分算子张量划分为多个级别的子张量,并将中间级别的每个子张量分解为Tucker型插值分解,其因子矩阵以多级方式形成。对于一个离散化为具有$n^{2d}$个元素的$2d$模张量的$d$维积分算子,整体CPU时间和内存需求按$O(n^d)$缩放,与现有矩阵算法(如矩阵蝴蝶算法和快速傅里叶变换(FFT))的$O(n^d\log n)$需求形成鲜明对比,其中$n$是每个方向上的点数。与其他张量算法(如量化张量训练(QTT))相比,所提出的算法在张量收缩方面也表现出更优越的CPU和内存性能。值得注意的是,张量蝴蝶算法可以高效地模拟两个单位立方体之间的高频格林函数相互作用,每个立方体在每个方向上跨越512个波长,这比现有蝴蝶算法可处理的问题规模大超过$512\times$。另一方面,对于每个方向64个波长的代表性问题(这是现有算法能处理的最大规模),我们的张量蝴蝶算法与现有算法相比,实现了200倍加速和$30\times$内存减少。此外,张量蝴蝶算法还允许在高达$d=6$维的情况下实现$O(n^d)$复杂度的FFT和拉东变换。
英文摘要:
This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels, and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a $d$-dimensional integral operator discretized into a $2d$-mode tensor with $n^{2d}$ entries, the overall CPU time and memory requirement scale as $O(n^d)$, in stark contrast to the $O(n^d\log n)$ requirement of existing matrix algorithms such as matrix butterfly algorithm and fast Fourier transforms (FFT), where $n$ is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents over $512\times$ larger problem sizes than existing butterfly algorithms. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and $30\times$ memory reduction comparing with existing ones. Moreover, the tensor butterfly algorithm also permits $O(n^d)$-complexity FFTs and Radon transforms up to $d=6$ dimensions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。