EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A treecode based on barycentric Hermite interpolation for electrostatic particle interactions

Robert Krasny, Lei Wang

Computational and Mathematical Biophysics · 2019

DOI: 10.1515/cmb-2019-0006 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Computational and Mathematical Biophysics, 2019. Verfasst von Robert Krasny und 1 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A particle-cluster treecode based on barycentric Hermite interpolation is presented for fast summation of electrostatic particle interactions in 3D. The interpolation nodes are Chebyshev points of the 2nd kind in each cluster. It is noted that barycentric Hermite interpolation is scale-invariant in a certain sense that promotes the treecode’s efficiency. Numerical results for the Coulomb and screened Coulomb potentials show that the treecode run time scales like O ( N log N ), where N is the number of particles in the system. The advantage of the barycentric Hermite treecode is demonstrated in comparison with treecodes based on Taylor approximation and barycentric Lagrange interpolation.

Zitieren

APA

Krasny, R., & Wang, L. (2019). A treecode based on barycentric Hermite interpolation for electrostatic particle interactions. Computational and Mathematical Biophysics. https://doi.org/10.1515/cmb-2019-0006

Vancouver

Krasny R, Wang L. A treecode based on barycentric Hermite interpolation for electrostatic particle interactions. Computational and Mathematical Biophysics. 2019. doi:10.1515/cmb-2019-0006

BibTeX
@article{Krasny2019,
  author = {Krasny, Robert and Wang, Lei},
  title = {A treecode based on barycentric Hermite interpolation for electrostatic particle interactions},
  journal = {Computational and Mathematical Biophysics},
  year = {2019},
  doi = {10.1515/cmb-2019-0006}
}
Kostenlos starten →