Fast summation based on fast trigonometric transforms at non‐equispaced nodes

This publication has 16 references indexed in Scilit:

• Fast algorithms for discrete polynomial transforms on arbitrary grids
  Linear Algebra and its Applications, 2003
• Fast Summation at Nonequispaced Knots by NFFT
  SIAM Journal on Scientific Computing, 2003
• A Multiresolution Approach to Regularization of Singular Operators and Fast Summation
  SIAM Journal on Scientific Computing, 2002
• Fast Fourier Transforms for Nonequispaced Data: A Tutorial
  2001
• A Sparse Matrix Arithmetic Based on $\Cal H$ -Matrices. Part I: Introduction to ${\Cal H}$ -Matrices
  Computing, 1999
• Mosaic-Skeleton approximations
  Calcolo, 1996
• Fast evaluation of radial basis functions: I
  Computers & Mathematics with Applications, 1992
• Fast wavelet transforms and numerical algorithms I
  Communications on Pure and Applied Mathematics, 1991
• On the fast matrix multiplication in the boundary element method by panel clustering
  Numerische Mathematik, 1989
• A fast algorithm for particle simulations
  Journal of Computational Physics, 1987