A kernel-independent uniform fast multipole method based on barycentric rational interpolation

DOI10.1007/s11075-022-01481-xMaRDI QIDQ6109891

Jiangli Liang, Shuhuang Xiang

Publication date: 31 July 2023

Published in: Numerical Algorithms (Search for Journal in Brave)

zbMATH Keywords

FFTfast multipole methodfast summationbarycentric interpolationFloater-Hormann rational interpolant

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• On the Lebesgue constant of barycentric rational interpolation at equidistant nodes
• A kernel-independent adaptive fast multipole algorithm in two and three dimensions
• The black-box fast multipole method
• Rapid solution of integral equations of scattering theory in two dimensions
• Diagonal forms of translation operators for the Helmholtz equation in three dimensions
• The fast multipole method: Numerical implementation
• Recent advances in linear barycentric rational interpolation
• Barycentric rational interpolation with no poles and high rates of approximation
• The Method of Regularized Stokeslets
• Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
• An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
• Fast Directional Multilevel Algorithms for Oscillatory Kernels
• An Improved Fast Multipole Algorithm for Potential Fields
• An Improved Fast Multipole Algorithm for Potential Fields on the Line
• Convergence of Linear Barycentric Rational Interpolation for Analytic Functions
• Fourier-Based Fast Multipole Method for the Helmholtz Equation
• A fast algorithm for particle simulations

This page was built for publication: A kernel-independent uniform fast multipole method based on barycentric rational interpolation