A General Algorithm for Calculating Irreducible Brillouin Zones
From MaRDI portal
Publication:5065183
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Other geometric groups, including crystallographic groups (20H15) Relations of manifolds and cell complexes with physics (57Z05) Relations of manifolds and cell complexes with chemistry (57Z15)
Recommendations
- Automatic, high-order, and adaptive algorithms for Brillouin zone integration
- Special points for two-dimensional Brillouin zone or Wigner-Seitz cell integrations
- Tetrahedron methods for Brillouin zone integration
- Quadratic and cubic tetrahedron methods for Brillouin zone integration
- An algebraic formulation and implementation of the tetrahedron linear method for the Brillouin zone integration of spectral functions
Cites work
- A procedure for the construction of Voronoi polyhedra
- Brillouin-zone database on the \textit{Bilbao Crystallographic Server}.
- Julia: a fresh approach to numerical computing
- Low-dimensional lattice basis reduction revisited
- Numerical quadrature in the Brillouin zone for periodic Schrödinger operators
- The quickhull algorithm for convex hulls
Cited in
(4)
This page was built for publication: A General Algorithm for Calculating Irreducible Brillouin Zones
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5065183)