A high-order fast method for computing convolution integral with smooth kernel
In this paper we report on a high-order fast method to numerically calculate convolution integral with smooth non-periodic kernel. This method is based on the Newton-Cotes quadrature rule for the integral approximation and an FFT method for discrete summation. The method can have an arbitrarily high-order accuracy in principle depending on the number of points used in the integral approximation and a computational cost of O(Nlog(N)), where N is the number of grid points. For a three-point Simpson rule approximation, the method has an accuracy of O(h{sup 4}), where h is the size of the computational grid. Applications of the Simpson rule based algorithm to the calculation of a one-dimensional continuous Gauss transform and to the calculation of a two-dimensional electric field from a charged beam are also presented.
- Research Organization:
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- Accelerator& Fusion Research Division
- DOE Contract Number:
- DE-AC02-05CH11231
- OSTI ID:
- 974162
- Report Number(s):
- LBNL-2667E; TRN: US1002260
- Journal Information:
- Computer Physics Communication, Journal Name: Computer Physics Communication
- Country of Publication:
- United States
- Language:
- English
Similar Records
Multiple expansions and pseudospectral cardinal functions: A new generalization of the fast fourier transform
Quadrature rules for singular integrals with application to Schwarz--Christoffel mappings