Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces
From MaRDI portal
Publication:2425260
DOI10.1016/J.JCP.2018.05.028zbMATH Open1415.78009OpenAlexW2804068599WikidataQ129798785 ScholiaQ129798785MaRDI QIDQ2425260FDOQ2425260
Publication date: 26 June 2019
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://www.osti.gov/biblio/1439411
Complexity and performance of numerical algorithms (65Y20) Multipole methods applied to problems in optics and electromagnetic theory (78M16)
Cites Work
- Title not available (Why is that?)
- FMMLIB3D
- A fast algorithm for particle simulations
- A kernel-independent adaptive fast multipole algorithm in two and three dimensions
- A new version of the fast multipole method for screened Coulomb interactions in three dimensions
- A fast adaptive multipole algorithm in three dimensions
- The black-box fast multipole method
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- An Implementation of the Fast Multipole Method without Multipoles
- Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
- Traceless cartesian tensor forms for spherical harmonic functions: new theorems and applications to electrostatics of dielectric media
- Cartesian polytensors
Uses Software
This page was built for publication: Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425260)