Efficient algorithms for discrete lattice calculations

Authors:
M. Arndt;V. Sorkin;E. B. Tadmor
Affiliations:
School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA;Department of Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN 55455, USA;Department of Aerospace Engineering and Mechanics, University of Minnesota, Minneapolis, MN 55455, USA
Venue:
Journal of Computational Physics
Year:
2009

Citing 2
Cited 0

Numerical recipes in FORTRAN (2nd ed.): the art of scientific computing

Numerical recipes in FORTRAN (2nd ed.): the art of scientific computing
Closest point search in lattices

IEEE Transactions on Information Theory

Quantified Score

Hi-index	31.45

Visualization

Abstract

We discuss algorithms for lattice-based computations, in particular lattice reduction, the detection of nearest neighbors, and the computation of clusters of nearest neighbors. We focus on algorithms that are most efficient for low spatial dimensions (typically d=2,3) and input data within a reasonably limited range. This makes them most useful for physically oriented numerical simulations, for example of crystalline solids. Different solution strategies are discussed, formulated as algorithms, and numerically evaluated.