| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6892424 | Computers & Mathematics with Applications | 2017 | 19 Pages |
Abstract
Butterfly algorithms are an effective multilevel technique to compress discretizations of integral operators with highly oscillatory kernel functions. The particular version of the butterfly algorithm presented in Candès, et al. (2009) realizes the transfer between levels by Chebyshev interpolation. We present a refinement of the analysis given in Demanet, et al. (2012) for this particular algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
S. Börm, C. Börst, J.M. Melenk,