Efficient algorithms for discrete lattice calculations

M. Arndt; V. Sorkin; E. B. Tadmor

doi:10.1016/j.jcp.2009.03.039

Efficient algorithms for discrete lattice calculations

M. Arndt, V. Sorkin, E. B. Tadmor

Aerospace Engineering and Mechanics

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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.

Original language	English (US)
Pages (from-to)	4858-4880
Number of pages	23
Journal	Journal of Computational Physics
Volume	228
Issue number	13
DOIs	https://doi.org/10.1016/j.jcp.2009.03.039
State	Published - Jul 20 2009

Bibliographical note

Funding Information:
This work was supported in part by the Department of Energy under Award Number DE-FG02-05ER25706 and by the University of Minnesota Supercomputing Institute. The authors acknowledge preliminary work performed by Jon Wilkening on the “short-list” method, while working as a postdoctoral fellow on quasicontinuum applications. The authors would like to thank Ryan Elliott for his careful reading of the manuscript and many helpful comments.

Keywords

Cluster computation
Lattice algorithms
Lattice reduction
Nearest neighbor
Quasicontinuum

Publisher link

10.1016/j.jcp.2009.03.039

Find It

Find It at U of M Libraries

Cite this

@article{408d2468c9e4452ab7e42df89a14e516,

title = "Efficient algorithms for discrete lattice calculations",

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.",

keywords = "Cluster computation, Lattice algorithms, Lattice reduction, Nearest neighbor, Quasicontinuum",

author = "M. Arndt and V. Sorkin and Tadmor, {E. B.}",

note = "Funding Information: This work was supported in part by the Department of Energy under Award Number DE-FG02-05ER25706 and by the University of Minnesota Supercomputing Institute. The authors acknowledge preliminary work performed by Jon Wilkening on the “short-list” method, while working as a postdoctoral fellow on quasicontinuum applications. The authors would like to thank Ryan Elliott for his careful reading of the manuscript and many helpful comments. ",

year = "2009",

month = jul,

day = "20",

doi = "10.1016/j.jcp.2009.03.039",

language = "English (US)",

volume = "228",

pages = "4858--4880",

journal = "Journal of Computational Physics",

issn = "0021-9991",

publisher = "Academic Press Inc.",

number = "13",

}

TY - JOUR

T1 - Efficient algorithms for discrete lattice calculations

AU - Arndt, M.

AU - Sorkin, V.

AU - Tadmor, E. B.

N1 - Funding Information: This work was supported in part by the Department of Energy under Award Number DE-FG02-05ER25706 and by the University of Minnesota Supercomputing Institute. The authors acknowledge preliminary work performed by Jon Wilkening on the “short-list” method, while working as a postdoctoral fellow on quasicontinuum applications. The authors would like to thank Ryan Elliott for his careful reading of the manuscript and many helpful comments.

PY - 2009/7/20

Y1 - 2009/7/20

N2 - 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.

AB - 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.

KW - Cluster computation

KW - Lattice algorithms

KW - Lattice reduction

KW - Nearest neighbor

KW - Quasicontinuum

UR - http://www.scopus.com/inward/record.url?scp=68649084423&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68649084423&partnerID=8YFLogxK

U2 - 10.1016/j.jcp.2009.03.039

DO - 10.1016/j.jcp.2009.03.039

M3 - Article

AN - SCOPUS:68649084423

SN - 0021-9991

VL - 228

SP - 4858

EP - 4880

JO - Journal of Computational Physics

JF - Journal of Computational Physics

IS - 13

ER -

Efficient algorithms for discrete lattice calculations

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this