An analysis of a butterfly algorithm

Börm, Steffen, Börst, C. and Melenk, J.M. (2017) An analysis of a butterfly algorithm Computers & Mathematics with Applications, 74 (9). pp. 2125-2143. DOI 10.1016/j.camwa.2017.05.019.

Full text not available from this repository.

Supplementary data:


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.

Document Type: Article
Keywords: Butterfly algorithmStability of iterated polynomial interpolation
Research affiliation: Kiel University
Kiel University > Kiel Marine Science
OceanRep > The Future Ocean - Cluster of Excellence
Refereed: Yes
DOI etc.: 10.1016/j.camwa.2017.05.019
ISSN: 08981221
Projects: Future Ocean
Date Deposited: 31 Jan 2018 10:58
Last Modified: 31 Jan 2018 10:58

Actions (login required)

View Item View Item