A fast simple algorithm for computing the potential of charges on a line
- 1 November 2020
- journal article
- research article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 49 (3) , 815-830
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Air Force Office of Scientific Research
- Office of Naval Research
- National Science Foundation
This publication has 9 references indexed in Scilit:
- Approximation by exponential sums revisitedApplied and Computational Harmonic Analysis, 2010
- A Nonlinear Optimization Procedure for Generalized Gaussian QuadraturesSIAM Journal on Scientific Computing, 2010
- The black-box fast multipole methodJournal of Computational Physics, 2009
- On approximation of functions by exponential sumsApplied and Computational Harmonic Analysis, 2005
- An Improved Fast Multipole Algorithm for Potential Fields on the LineSIAM Journal on Numerical Analysis, 1999
- Fast Algorithms for Polynomial Interpolation, Integration, and DifferentiationSIAM Journal on Numerical Analysis, 1996
- Preconditioned, Adaptive, Multipole-Accelerated Iterative Methods for Three-Dimensional First-Kind Integral Equations of Potential TheorySIAM Journal on Scientific Computing, 1994
- The Rapid Evaluation of Potential Fields in Particle Systems1988
- A fast algorithm for the discrete laplace transformationJournal of Complexity, 1988