Algorithms for target transformations of lattice basis vectors

DOI10.1107/S2053273320012668MaRDI QIDQ6563699zbMATH OpenWikidataFDO

Authors Semën Gorfman

Publication date 27 June 2024

Published in Acta Crystallographica. Section A (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1107/S2053273320012668

zbMATH Keywords

crystal latticelattice planestransformationszones

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Quasicrystals and aperiodic tilings in discrete geometry (52C23) Crystalline structure (74E15) Crystals in solids (74N05)

Recommendations

• Efficient algorithms for discrete lattice calculations
• A modification of the LLL reduction algorithm
• Lattice reduction using a Euclidean algorithm
• Simultaneous reduction of a lattice basis and its reciprocal basis
• A new method for lattice reduction using directional and hyperplanar shearing

Cited in

(1)

• A fast algorithm to find reduced hyperplane unit cells and solve N-dimensional Bézout's identities

This page was built for publication: Algorithms for target transformations of lattice basis vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6563699)