This paper introduces a "kernel-independent" interpolative decomposition butterfly factorization (IDBF) as a data-sparse approximation for matrices that satisfy a complementary low-rank property. The IDBF can be constructed in $O(N\log N)$ operations for an $N\times N$ matrix via hierarchical interpolative decompositions (IDs), if matrix entries can be sampled individually and each sample takes $O(1)$ operations. The resulting factorization is a product of $O(\log N)$ sparse matrices, each with $O(N)$ non-zero entries. Hence, it can be applied to a vector rapidly in $O(N\log N)$ operations. IDBF is a general framework for nearly optimal fast matvec useful in a wide range of applications, e.g., special function transformation, Fourier integral operators, high-frequency wave computation. Numerical results are provided to demonstrate the effectiveness of the butterfly factorization and its construction algorithms.
RSVDPACK: An implementation of randomized algorithms for computing the singular value, interpolative, and CUR decompositions of matrices on multi-core and GPU architectures
A Butterfly-Based Direct Integral Equation Solver Using Hierarchical LU Factorization for Analyzing Scattering from Electrically Large Conducting Objects
Department of Electrical Engineering and Computer Science, University of Michigan(密歇根大学电气与计算机工程系);University of Michigan(密歇根大学);Department of Microwave Engineering, University of Electronic Science and Technology of China(电子科技大学微波工程系);University of Electronic Science and Technology of China(电子科技大学)
Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition
PSI Center for Scientific Computing, Theory and Data(PSI科学计算、理论与数据中心);Institute of Mathematics, EPFL(洛桑联邦理工学院数学研究所);The University of Maryland, College Park(马里兰大学帕克分校)