The grid-based fast multipole method - a massively parallel numerical scheme for calculating two-electron interaction energies

Show full item record



Permalink

http://hdl.handle.net/10138/224648

Citation

Toivanen , E A , Losilla , S A & Sundholm , D 2015 , ' The grid-based fast multipole method - a massively parallel numerical scheme for calculating two-electron interaction energies ' Physical Chemistry Chemical Physics , vol. 17 , no. 47 , pp. 31480-31490 . DOI: 10.1039/c5cp01173f

Title: The grid-based fast multipole method - a massively parallel numerical scheme for calculating two-electron interaction energies
Author: Toivanen, Elias A.; Losilla, Sergio A.; Sundholm, Dage
Contributor: University of Helsinki, Department of Chemistry
University of Helsinki, Laboratory of Physical Chemistry (Dep. of Chemistry) (-2009)
University of Helsinki, Department of Chemistry
Date: 2015
Language: eng
Number of pages: 11
Belongs to series: Physical Chemistry Chemical Physics
ISSN: 1463-9076
URI: http://hdl.handle.net/10138/224648
Abstract: Algorithms and working expressions for a grid-based fast multipole method (GB-FMM) have been developed and implemented. The computational domain is divided into cubic subdomains, organized in a hierarchical tree. The contribution to the electrostatic interaction energies from pairs of neighboring subdomains is computed using numerical integration, whereas the contributions from further apart subdomains are obtained using multipole expansions. The multipole moments of the subdomains are obtained by numerical integration. Linear scaling is achieved by translating and summing the multipoles according to the tree structure, such that each subdomain interacts with a number of subdomains that are almost independent of the size of the system. To compute electrostatic interaction energies of neighboring subdomains, we employ an algorithm which performs efficiently on general purpose graphics processing units (GPGPU). Calculations using one CPU for the FMM part and 20 GPGPUs consisting of tens of thousands of execution threads for the numerical integration algorithm show the scalability and parallel performance of the scheme. For calculations on systems consisting of Gaussian functions (alpha = 1) distributed as fullerenes from C-20 to C-720, the total computation time and relative accuracy (ppb) are independent of the system size.
Subject: GRAPHICAL PROCESSING UNITS
QUANTUM-CHEMISTRY CALCULATIONS
EFFICIENT IMPLEMENTATION
WAVE-FUNCTIONS
FOCK MATRIX
SIMULATIONS
CONSTRUCTION
MOLECULES
INTEGRALS
ACCURACY
116 Chemical sciences
114 Physical sciences
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
c5cp01173f.pdf 2.876Mb PDF View/Open

This item appears in the following Collection(s)

Show full item record