Butterfly factorization via randomized matrix-vector multiplications

Abstract

This paper presents an adaptive randomized algorithm for computing the butterfly factorization of a $m\times n$ matrix with $m\approx n$ provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The resulting factorization is composed of $O(\log n)$ sparse factors, each containing $O(n)$ nonzero entries. The factorization can be attained using $O(n^{3/2}\log n)$ computation and $O(n\log n)$ memory resources. The proposed algorithm applies to matrices with strong and weak admissibility conditions arising from surface integral equation solvers with a rigorous error bound, and is implemented in parallel.

References in corpus (4)

• Interpolative Butterfly Factorization
• Multidimensional Butterfly Factorization
• A Unified Framework for Oscillatory Integral Transform: When to use NUFFT or Butterfly Factorization?
• A Hierarchical Butterfly LU Preconditioner for Two-Dimensional Electromagnetic Scattering Problems Involving Open Surfaces

Cited by in corpus (4)

• Accurate and Robust Deep Learning Framework for Solving Wave-Based Inverse Problems in the Super-Resolution Regime
• Efficient construction of an HSS preconditioner for symmetric positive definite ${\mathcal{H}}^2$ matrices
• Approximate inversion of discrete Fourier integral operators
• Sparse Approximate Multifrontal Factorization with Butterfly Compression for High Frequency Wave Equations