Documentation

Returns a mesh of points within the n-parallelepiped subtended by the reciprocal lattice vectors. Covers the entire brillouin zone, though not in the shape you might expect, and not in a way that's pretty for graphing.

As meshBZ, but with parallelepipeds extending in each quadrant, octant... n-ant of the reciprocal lattice basis. Should cover more than the entire first Brillouin zone.

Integrates using a simple grid-sum.

As bzIntegral, but also gives the absolute error as the second value in the returned tuple.

Given a function defined on the Brillouin zone, evaluate it everywhere by doing nested single integrations and using Takahashi and Mori's Tanh-Sinh quadrature method. Should be robust against singularities and the like, and is properly set up for massive parallelization (via EdwardKmett's integration library, certainly not mine). Watch Dirac run this thing. Only implemented in 2D.

Given a list of points in k-space, return a list of points that interpolates affine paths between them, in turn; a typical usage case might be

kPath [gammaPoint, kPoint, mPoint, gammaPoint]

which is used in the bandPlot function. The spacing between points on the interpolated path is determined by the meshingData parameter.