Efficient algorithms for discrete lattice calculations
From MaRDI portal
Publication:2390437
DOI10.1016/J.JCP.2009.03.039zbMATH Open1169.82305OpenAlexW2125364318MaRDI QIDQ2390437FDOQ2390437
Authors: Marcel Arndt, V. Sorkin, Ellad B. Tadmor
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factoring polynomials with rational coefficients
- Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
- Title not available (Why is that?)
- An adaptive finite element approach to atomic-scale mechanics. -- The quasicontinuum method
- Closest point search in lattices
- On Essential and Non-Essential Descriptions of Multilattices
- Geometry and symmetry of multilattices
Cited In (6)
- A refinement indicator for adaptive quasicontinuum approaches for structural lattices
- From prima quadraginta octant to lattice sphere through primitive integer operations
- Algorithms for target transformations of lattice basis vectors
- Discrete Geometry for Computer Imagery
- Computing efficiently the lattice width in any dimension
- Rapid Bravais-lattice determination algorithm for lattice parameters containing large observation errors
This page was built for publication: Efficient algorithms for discrete lattice calculations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390437)