Efficient algorithms for discrete lattice calculations
From MaRDI portal
Publication:2390437
Recommendations
Cites work
- scientific article; zbMATH DE number 274399 (Why is no real title available?)
- scientific article; zbMATH DE number 5050923 (Why is no real title available?)
- scientific article; zbMATH DE number 3333393 (Why is no real title available?)
- An adaptive finite element approach to atomic-scale mechanics. -- The quasicontinuum method
- Closest point search in lattices
- Factoring polynomials with rational coefficients
- Geometry and symmetry of multilattices
- Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
- On Essential and Non-Essential Descriptions of Multilattices
Cited in
(6)- A refinement indicator for adaptive quasicontinuum approaches for structural lattices
- Discrete Geometry for Computer Imagery
- Algorithms for target transformations of lattice basis vectors
- Rapid Bravais-lattice determination algorithm for lattice parameters containing large observation errors
- From prima quadraginta octant to lattice sphere through primitive integer operations
- Computing efficiently the lattice width in any dimension
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)