Improve the efficiency of the Cartesian tensor based fast multipole method for Coulomb interaction using the traces
From MaRDI portal
Publication:2425260
Recommendations
- A new version of the fast multipole method for screened Coulomb interactions in three dimensions
- An Improved Fast Multipole Algorithm for Potential Fields
- Fast Coulomb matrix construction via compressing the interactions between continuous charge distributions
- Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
- Cauchy fast multipole method for general analytic kernels
Cites work
- A Fast Adaptive Multipole Algorithm for Particle Simulations
- A fast adaptive multipole algorithm in three dimensions
- 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
- Accelerated Cartesian expansions -- a fast method for computing of potentials of the form \(R^{ - \nu }\) for all real \(\nu \)
- An Implementation of the Fast Multipole Method without Multipoles
- Cartesian polytensors
- FMMLIB3D
- scientific article; zbMATH DE number 1069612 (Why is no real title available?)
- The black-box fast multipole method
- Traceless cartesian tensor forms for spherical harmonic functions: new theorems and applications to electrostatics of dielectric media
Cited in
(1)
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)