Fast computation of the spectral differentiation by the fast multipole method

DOI10.1016/j.camwa.2019.02.024zbMath1442.78010OpenAlexW2922290757WikidataQ128248545 ScholiaQ128248545MaRDI QIDQ2204065

Yan Tian, Shuhuang Xiang, Guidong Liu

Publication date: 2 October 2020

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2019.02.024

zbMATH Keywords

pseudospectral methodfast multipole methodbarycentric interpolation

Mathematics Subject Classification ID

Numerical interpolation (65D05) Multipole methods applied to problems in optics and electromagnetic theory (78M16)

Related Items (2)

Barycentric prolate interpolation and pseudospectral differentiation ⋮ Superconvergence and fast implementation of the barycentric prolate differentiation

Uses Software

• Chebfun
• RECFMM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(hp\)-convergence of prolate spheroidal wave functions and a new well-conditioned prolate-collocation scheme
• Convergence rates of derivatives of a family of barycentric rational interpolants
• Error bounds for approximation in Chebyshev points
• Multipole expansions and pseudospectral cardinal functions: A new generalization of the fast Fourier transform
• On the evaluation of polynomial coefficients
• On optimal convergence rates of a two-dimensional fast multipole method
• Fast multipole methods for approximating a function from sampling values
• Chebfun and numerical quadrature
• Numerical investigation on the obliquely incident water wave passing through the submerged breakwater by singular boundary method
• A modified singular boundary method for three-dimensional high frequency acoustic wave problems
• A fast multipole method for the three-dimensional Stokes equations
• On Well-Conditioned Spectral Collocation and Spectral Methods by the Integral Reformulation
• A Well-Conditioned Collocation Method Using a Pseudospectral Integration Matrix
• Spectral Methods
• Explicit barycentric weights for polynomial interpolation in the roots or extrema of classical orthogonal polynomials
• An Accelerated Kernel-Independent Fast Multipole Method in One Dimension
• A Fast Algorithm for the Calculation of the Roots of Special Functions
• Analysis of spectral approximations using prolate spheroidal wave functions
• A Rational Spectral Collocation Method with Adaptively Transformed Chebyshev Grid Points
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• A Fast Adaptive Multipole Algorithm for Particle Simulations
• Integration Preconditioning of Pseudospectral Operators. I. Basic Linear Operators
• An Improved Fast Multipole Algorithm for Potential Fields on the Line
• Generation of Pseudospectral Differentiation Matrices I
• The Fast Multipole Method I: Error Analysis and Asymptotic Complexity
• Error bounds of singular boundary method for potential problems
• Singular boundary method based on time‐dependent fundamental solutions for active noise control
• Barycentric Lagrange Interpolation
• Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
• Stability of Barycentric Interpolation Formulas for Extrapolation
• A Hybrid Fast Multipole Pseudo-Spectral Time Domain Method
• <scp>REC</scp>FMM: Recursive Parallelization of the Adaptive Fast Multipole Method for Coulomb and Screened Coulomb Interactions
• On the convergence rates of Legendre approximation
• Lagrangian Interpolation at the Chebyshev Points xn,     cos (  /n),   = 0(1)n; some Unnoted Advantages
• On Interpolation Approximation: Convergence Rates for Polynomial Interpolation for Functions of Limited Regularity
• A fast algorithm for particle simulations

This page was built for publication: Fast computation of the spectral differentiation by the fast multipole method