DSDavoud Saffar Shamshirgar

Davoud Saffar Shamshirgar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Davoud Saffar Shamshirgar has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Fast Ewald summation for electrostatic potentials with arbitrary periodicity

    by D. S. Shamshirgar, J. Bagge, A.-K. Tornberg

    A unified treatment for the fast and spectrally accurate evaluation of electrostatic potentials with periodic boundary conditions in any or none of the three spatial dimensions is presented. Ewald decomposition is used to split the problem into real-space and Fourier-space parts, and the Fast Fourier Transform (FFT)-based Spectral Ewald (SE) method is used to accelerate computation of the latter, yielding the total runtime O(N⁡log(N)) for N sources. A key component is a new FFT-based solution technique for the free-space Poisson problem. The computational cost is further reduced by a new adaptive FFT for the doubly and singly periodic cases, allowing for different local upsampling factors. The SE method is most efficient in the triply periodic case where the cost of computing FFTs is the lowest, whereas the rest of the algorithm is essentially independent of periodicity. We show that removing periodic boundary conditions from one or two directions out of three will only moderately increase the total runtime, and in the free-space case, the runtime is around four times that of the triply periodic case. The Gaussian window function previously used in the SE method is compared with a new piecewise polynomial approximation of the Kaiser–Bessel window, which further reduces the runtime. We present error estimates and a parameter selection scheme for all parameters of the method, including a new estimate for the shape parameter of the Kaiser–Bessel window. Finally, we consider methods for force computation and compare the runtime of the SE method with that of the fast multipole method.


  • Open Access

    Fast Ewald summation for electrostatic potentials with arbitrary periodicity

    by Davood Saffar Shamshirgar, Joar Bagge, Anna-Karin Tornberg

    A unified treatment for fast and spectrally accurate evaluation of electrostatic potentials subject to periodic boundary conditions in any or none of the three spatial dimensions is presented. Ewald decomposition is used to split the problem into a real-space and a Fourier-space part, and the FFT-based Spectral Ewald (SE) method is used to accelerate the computation of the latter. A key component in the unified treatment is an FFT-based solution technique for the free-space Poisson problem in three, two or one dimensions, depending on the number of non-periodic directions. The computational cost is furthermore reduced by employing an adaptive FFT for the doubly and singly periodic cases, allowing for different local upsampling factors. The SE method will always be most efficient for the triply periodic case as the cost of computing FFTs will then be the smallest, whereas the computational cost of the rest of the algorithm is essentially independent of periodicity. We show that the cost of removing periodic boundary conditions from one or two directions out of three will only moderately increase the total runtime. Our comparisons also show that the computational cost of the SE method in the free-space case is around four times that of the triply periodic case. The Gaussian window function previously used in the SE method, is here compared to a piecewise polynomial approximation of the Kaiser-Bessel window function. With a carefully tuned shape parameter that is selected based on an error estimate for this new window function, runtimes for the SE method can be further reduced. Furthermore, we consider different methods for computing the force, and compare the runtime of the SE method with that of the Fast Multipole Method.

  • Open Access

    Regularizing the fast multipole method for use in molecular simulation

    by D. S. Shamshirgar, R. Yokota, A.-K. Tornberg, B. Hess

    The parallel scaling of classical molecular dynamics simulations is limited by the communication of the 3D fast Fourier transform of the particle-mesh electrostatics methods, which are used by most molecular simulation packages. The Fast Multipole Method (FMM) has much lower communication requirements and would, therefore, be a promising alternative to mesh based approaches. However, the abrupt switch from direct particle-particle interactions to approximate multipole interactions causes a violation of energy conservation, which is required in molecular dynamics. To counteract this effect, higher accuracy must be requested from the FMM, leading to a substantially increased computational cost. Here, we present a regularization of the FMM that provides analytical energy conservation. This allows the use of a precision comparable to that used with particle-mesh methods, which significantly increases the efficiency. With an application to a 2D system of dipolar molecules representative of water, we show that the regularization not only provides energy conservation but also significantly improves the accuracy. The latter is possible due to the local charge neutrality in molecular systems. Additionally, we show that the regularization reduces the multipole coefficients for a 3D water model even more than in our 2D example.


  • Open Access

    A comparison of the Spectral Ewald and Smooth Particle Mesh Ewald methods in GROMACS

    by Davood Saffar Shamshirgar, Berk Hess, Anna-Karin Tornberg

    The smooth particle mesh Ewald (SPME) method is an FFT based method for the fast evaluation of electrostatic interactions under periodic boundary conditions. A highly optimized implementation of this method is available in GROMACS, a widely used software for molecular dynamics simulations. In this article, we compare a more recent method from the same family of methods, the spectral Ewald (SE) method, to the SPME method in terms of performance and efficiency. We consider serial and parallel implementations of both methods for single and multiple core computations on a desktop machine as well as the Beskow supercomputer at KTH Royal Institute of Technology. The implementation of the SE method has been well optimized, however not yet comparable to the level of the SPME implementation that has been improved upon for many years. We show that the SE method is very efficient whenever used to achieve high accuracy and that it already at this level of optimization can be competitive for low accuracy demands.


  • The Spectral Ewald method for singly periodic domains

    by Davoud Saffar Shamshirgar, Anna-Karin Tornberg


  • Open Access

    The Spectral Ewald method for singly periodic domains

    by Davoud Saffar Shamshirgar, Anna-Karin Tornberg

    We present a fast and spectrally accurate method for efficient computation of the three dimensional Coulomb potential with periodicity in one direction. The algorithm is FFT-based and uses the so-called Ewald decomposition, which is naturally most efficient for the triply periodic case. In this paper, we show how to extend the triply periodic Spectral Ewald method to the singly periodic case, such that the cost of computing the singly periodic potential is only marginally larger than the cost of computing the potential for the corresponding triply periodic system. In the Fourier space contribution of the Ewald decomposition, a Fourier series is obtained in the periodic direction with a Fourier integral over the non periodic directions for each discrete wave number. We show that upsampling to resolve the integral is only needed for modes with small wave numbers. For the zero wave number, this Fourier integral has a singularity. For this mode, we effectively need to solve a free-space Poisson equation in two dimensions. A very recent idea by Vico et al. makes it possible to use FFTs to solve this problem, allowing us to unify the treatment of all modes. An adaptive 3D FFT can be established to apply different upsampling rates locally. The computational cost for other parts of the algorithm is essentially unchanged as compared to the triply periodic case, in total yielding only a small increase in both computational cost and memory usage for this singly periodic case.

  • Open Access

    Fast Ewald summation for free-space Stokes potentials

    by Ludvig Af Klinteberg, Davoud Saffar Shamshirgar, Anna-Karin Tornberg


  • Open Access

    Fast Ewald summation for free-space Stokes potentials

    by Ludvig Af Klinteberg, Davoud Saffar Shamshirgar, Anna-Karin Tornberg

    We present a spectrally accurate method for the rapid evaluation of free-space Stokes potentials, i.e. sums involving a large number of free space Green's functions. We consider sums involving stokeslets, stresslets and rotlets that appear in boundary integral methods and potential methods for solving Stokes equations. The method combines the framework of the Spectral Ewald method for periodic problems, with a very recent approach to solving the free-space harmonic and biharmonic equations using fast Fourier transforms (FFTs) on a uniform grid. Convolution with a truncated Gaussian function is used to place point sources on a grid. With precomputation of a scalar grid quantity that does not depend on these sources, the amount of oversampling of the grids with Gaussians can be kept at a factor of two, the minimum for aperiodic convolutions by FFTs. The resulting algorithm has a computational complexity of O(N log N) for problems with N sources and targets. Comparison is made with a fast multipole method (FMM) to show that the performance of the new method is competitive.