An analysis of a butterfly algorithm

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.

References in corpus (3)

• Robust exponential convergence of $hp$-FEM in balanced norms for singularly perturbed reaction-diffusion equations
• Multidimensional Butterfly Factorization
• Directional H2-matrix compression for high-frequency problems

Cited by in corpus (5)

• Simple and robust equilibrated flux a posteriori estimates for singularly perturbed reaction-diffusion problems
• Exponential Convergence of $hp$ FEM for Spectral Fractional Diffusion in Polygons
• Exponential Convergence of hp FEM for the Integral Fractional Laplacian in Polygons
• Accurate and Robust Deep Learning Framework for Solving Wave-Based Inverse Problems in the Super-Resolution Regime
• Variable Order, Directional H2-Matrices for Helmholtz Problems with Complex Frequency