An analysis of a butterfly algorithm
arXiv:1703.0194113 citations
Originality Synthesis-oriented
AI Analysis
Provides tighter theoretical guarantees for a known numerical method, benefiting computational scientists using fast integral operator solvers.
The paper refines the stability analysis of a butterfly algorithm using Chebyshev interpolation, improving error bound estimates for compressing oscillatory integral operators.
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 considered here realizes the transfer between levels by Chebyshev interpolation. We present a refinement of the analysis that improves the stability estimates underlying the error bounds.