Name
Abstract | ||
|---|---|---|
The paper introduces the butterfly factorization as a data-sparseapproximation for the matrices that satisfy a complementary low-rankproperty. The factorization can be constructed efficiently if eitherfast algorithms for applying the matrix and its adjoint are availableor the entries of the matrix can be sampled individually. For an$N\\times 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. Numericalresults are provided to demonstrate the effectiveness of the butterflyfactorization and its construction algorithms. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1137/15M1007173 | Multiscale Modeling & Simulation |
DocType | Volume | Issue |
Journal | 13 | 2 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yingzhou Li | 1 | 2 | 1.04 |
| Haizhao Yang | 2 | 46 | 13.03 |
| Eileen R. Martin | 3 | 0 | 0.34 |
| Kenneth L. Ho | 4 | 55 | 6.01 |
| Lexing Ying | 5 | 1273 | 103.92 |