Abstract

This paper presents an algorithm for the acceleration of the series involved in the computation of 2-D homogeneous Green's functions with 1-D and 2-D periodicities. The algorithm is based on an original implementation of the spectral Kummer-Poisson's method, and it can be applied to the efficient computation of a wide class of infinite series. In the algorithm the number of asymptotic terms retained in Kummer's transformation is externally controlled so that any of the series that has to be accelerated is split into one series with exponential convergence and another series with algebraic convergence of arbitrarily large order. Numerical simulations have shown that there is an ldquooptimumrdquo number of asymptotic terms retained in Kummer's transformation for which the CPU time needed in the summation of the series is minimized. The CPU times required by Ewald's method for the evaluation of 2-D Green's functions with 1-D and 2-D periodicities have been compared with those required by the present algorithm, and the algorithm has been found to be between 1.2 and 3 times faster than Ewald's method when working in ldquooptimumrdquo operation conditions.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call