On the computation of lattice sums without translational invariance

  • Buchheit A
  • Keßler T
  • Serkh K
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper introduces a new method for the efficient computation of oscillatory multidimensional lattice sums in geometries with boundaries. Such sums are ubiquitous in both pure and applied mathematics and have immediate applications in condensed matter and topological quantum physics. The challenge in their evaluation results from the combination of singular long-range interactions with the loss of translational invariance caused by the boundaries, rendering standard tools like Ewald summation ineffective. Our work shows that these lattice sums can be generated from a generalization of the Riemann zeta function to multidimensional non-periodic lattice sums. We put forth a new representation of this zeta function together with a numerical algorithm that ensures exponential convergence across an extensive range of geometries. Notably, our method’s runtime is influenced only by the complexity of the considered geometries and not by the number of particles, providing the foundation for efficient and precise simulations of macroscopic condensed matter systems. We showcase the practical utility of our method by computing interaction energies in a three-dimensional crystal structure with 3 × 10 23 3\times 10^{23} particles. Our method’s accuracy is demonstrated through extensive numerical experiments. A reference implementation is provided online along with this article.

Cite

CITATION STYLE

APA

Buchheit, A., Keßler, T., & Serkh, K. (2024). On the computation of lattice sums without translational invariance. Mathematics of Computation, 94(355), 2533–2574. https://doi.org/10.1090/mcom/4024

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free