Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces
Abstract
To compute the non-oscillating mutual interaction for a systems with N points, the fast multipole method (FMM) has an efficiency that scales linearly with the number of points. Specifically, for Coulomb interaction, FMM can be constructed using either the spherical harmonic functions or the totally symmetric Cartesian tensors. In this paper, we will present that the effciency of the Cartesian tensor-based FMM for the Coulomb interaction can be significantly improved by implementing the traces of the Cartesian tensors in calculation to reduce the independent elements of the n-th rank totally symmetric Cartesian tensor from (n + 1)(n + 2)=2 to 2n + 1. The computation complexity for the operations in FMM are analyzed and expressed as polynomials of the highest rank of the Cartesian tensors. For most operations, the complexity is reduced by one order. Numerical examples regarding the convergence and the effciency of the new algorithm are demonstrated. As a result, a reduction of computation time up to 50% has been observed for a moderate number of points and rank of tensors.
- Authors:
-
- Old Dominion Univ., Norfolk, VA (United States)
- Thomas Jefferson National Accelerator Facility (TJNAF), Newport News, VA (United States)
- Publication Date:
- Research Org.:
- Thomas Jefferson National Accelerator Facility (TJNAF), Newport News, VA (United States)
- Sponsoring Org.:
- USDOE Office of Science (SC), Nuclear Physics (NP)
- OSTI Identifier:
- 1439411
- Alternate Identifier(s):
- OSTI ID: 1582863
- Report Number(s):
- JLAB-ACP-17-2560; DOE/OR/23177-4223
Journal ID: ISSN 0021-9991; R&D Project: 2016-LDRD-7; PII: S0021999118303280; TRN: US1900604
- Grant/Contract Number:
- AC05-06OR23177
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Journal of Computational Physics
- Additional Journal Information:
- Journal Volume: 371; Journal Issue: C; Journal ID: ISSN 0021-9991
- Publisher:
- Elsevier
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; Fast multipole method; Cartesian tensor; Coulomb interaction
Citation Formats
Huang, He, Luo, Li -Shi, Li, Rui, Chen, Jie, and Zhang, He. Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces. United States: N. p., 2018.
Web. doi:10.1016/j.jcp.2018.05.028.
Huang, He, Luo, Li -Shi, Li, Rui, Chen, Jie, & Zhang, He. Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces. United States. https://doi.org/10.1016/j.jcp.2018.05.028
Huang, He, Luo, Li -Shi, Li, Rui, Chen, Jie, and Zhang, He. Thu .
"Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces". United States. https://doi.org/10.1016/j.jcp.2018.05.028. https://www.osti.gov/servlets/purl/1439411.
@article{osti_1439411,
title = {Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces},
author = {Huang, He and Luo, Li -Shi and Li, Rui and Chen, Jie and Zhang, He},
abstractNote = {To compute the non-oscillating mutual interaction for a systems with N points, the fast multipole method (FMM) has an efficiency that scales linearly with the number of points. Specifically, for Coulomb interaction, FMM can be constructed using either the spherical harmonic functions or the totally symmetric Cartesian tensors. In this paper, we will present that the effciency of the Cartesian tensor-based FMM for the Coulomb interaction can be significantly improved by implementing the traces of the Cartesian tensors in calculation to reduce the independent elements of the n-th rank totally symmetric Cartesian tensor from (n + 1)(n + 2)=2 to 2n + 1. The computation complexity for the operations in FMM are analyzed and expressed as polynomials of the highest rank of the Cartesian tensors. For most operations, the complexity is reduced by one order. Numerical examples regarding the convergence and the effciency of the new algorithm are demonstrated. As a result, a reduction of computation time up to 50% has been observed for a moderate number of points and rank of tensors.},
doi = {10.1016/j.jcp.2018.05.028},
journal = {Journal of Computational Physics},
number = C,
volume = 371,
place = {United States},
year = {Thu May 17 00:00:00 EDT 2018},
month = {Thu May 17 00:00:00 EDT 2018}
}
Web of Science
Figures / Tables:
Works referenced in this record:
An Efficient Program for Many-Body Simulation
journal, January 1985
- Appel, Andrew W.
- SIAM Journal on Scientific and Statistical Computing, Vol. 6, Issue 1
A fast algorithm for particle simulations
journal, December 1987
- Greengard, L.; Rokhlin, V.
- Journal of Computational Physics, Vol. 73, Issue 2
A new version of the Fast Multipole Method for the Laplace equation in three dimensions
journal, January 1997
- Greengard, Leslie; Rokhlin, Vladimir
- Acta Numerica, Vol. 6
A Fast Adaptive Multipole Algorithm for Particle Simulations
journal, July 1988
- Carrier, J.; Greengard, L.; Rokhlin, V.
- SIAM Journal on Scientific and Statistical Computing, Vol. 9, Issue 4
A Fast Adaptive Multipole Algorithm in Three Dimensions
journal, November 1999
- Cheng, H.; Greengard, L.; Rokhlin, V.
- Journal of Computational Physics, Vol. 155, Issue 2
A New Version of the Fast Multipole Method for Screened Coulomb Interactions in Three Dimensions
journal, August 2002
- Greengard, Leslie F.; Huang, Jingfang
- Journal of Computational Physics, Vol. 180, Issue 2
An Implementation of the Fast Multipole Method without Multipoles
journal, July 1992
- Anderson, Christopher R.
- SIAM Journal on Scientific and Statistical Computing, Vol. 13, Issue 4
A kernel-independent adaptive fast multipole algorithm in two and three dimensions
journal, May 2004
- Ying, Lexing; Biros, George; Zorin, Denis
- Journal of Computational Physics, Vol. 196, Issue 2
The black-box fast multipole method
journal, December 2009
- Fong, William; Darve, Eric
- Journal of Computational Physics, Vol. 228, Issue 23
Accelerated Cartesian expansions – A fast method for computing of potentials of the form R−ν for all real ν
journal, September 2007
- Shanker, B.; Huang, H.
- Journal of Computational Physics, Vol. 226, Issue 1
Cartesian polytensors
journal, April 1983
- Applequist, Jon
- Journal of Mathematical Physics, Vol. 24, Issue 4
Fundamental relationships in the theory of electric multipole moments and multipole polarizabilities in static fields
journal, April 1984
- Applequist, Jon
- Chemical Physics, Vol. 85, Issue 2
Traceless cartesian tensor forms for spherical harmonic functions: new theorems and applications to electrostatics of dielectric media
journal, October 1989
- Applequist, J.
- Journal of Physics A: Mathematical and General, Vol. 22, Issue 20
Works referencing / citing this record:
A New Relatively Simple Approach to Multipole Interactions in Either Spherical Harmonics or Cartesians, Suitable for Implementation into Ewald Sums
journal, December 2019
- Burnham, Christian J.; English, Niall J.
- International Journal of Molecular Sciences, Vol. 21, Issue 1
A New Relatively Simple Approach to Multipole Interactions in Either Spherical Harmonics or Cartesians, Suitable for Implementation into Ewald Sums
journal, December 2019
- Burnham, Christian J.; English, Niall J.
- International Journal of Molecular Sciences, Vol. 21, Issue 1
Figures / Tables found in this record: