DOE OSTI · 974162
A high-order fast method for computing convolution integral with smooth kernel
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Qiang, Ji. 2009-09-28. A high-order fast method for computing convolution integral with smooth kernel. https://www.osti.gov/biblio/974162
Cite the original work for its findings. Save a collection to share your selection of sources.