Butterfly Factorization

4 years 9 months ago
Butterfly Factorization
The paper introduces the butterfly factorization as a data-sparse approximation for the matrices that satisfy a complementary low-rank property. The factorization can be constructed efficiently if either fast algorithms for applying the matrix and its adjoint are available or the entries of the matrix can be sampled individually. For an N × N matrix, the resulting factorization is a product of O(log N) sparse matrices, each with O(N) nonzero entries. Hence, it can be applied rapidly in O(N log N) operations. Numerical results are provided to demonstrate the effectiveness of the butterfly factorization and its construction algorithms. Key words. data-sparse matrix, butterfly algorithm, randomized algorithm, matrix factorization, operator compression, Fourier integral operators, special functions AMS subject classifications. 44A55, 65R10, 65T50 DOI. 10.1137/15M1007173
Yingzhou Li, Haizhao Yang, Eileen R. Martin, Kenne
Added 14 Apr 2016
Updated 14 Apr 2016
Type Journal
Year 2015
Where MMAS
Authors Yingzhou Li, Haizhao Yang, Eileen R. Martin, Kenneth L. Ho, Lexing Ying
Comments (0)