An analysis of a butterfly algorithm
classification
🧮 math.NA
cs.NA
keywords
butterflyalgorithmanalysisalgorithmsboundschebyshevcompressconsidered
read the original 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 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.