Efficient algorithms for discrete lattice calculations

DOI10.1016/j.jcp.2009.03.039zbMath1169.82305OpenAlexW2125364318MaRDI QIDQ2390437

Marcel Arndt, Ellad B. Tadmor, V. Sorkin

Publication date: 22 July 2009

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2009.03.039

zbMATH Keywords

nearest neighborlattice reductionquasicontinuumlattice algorithmscluster computation

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Cites Work

• Factoring polynomials with rational coefficients
• Geometry and symmetry of multilattices
• An adaptive finite element approach to atomic-scale mechanics. -- The quasicontinuum method
• Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
• On Essential and Non-Essential Descriptions of Multilattices
• Closest point search in lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for discrete lattice calculations