Answers are grounded in this paper and cite their sources.
For a given elastic stiffness tetrad an algorithm is provided to determine the distance of this particular tetrad to all tetrads of a prescribed symmetry class. If the particular tetrad already belongs to this class then the distance is zero and the presentation of this tetrad with respect to the symmetry axes can be obtained. If the distance turns out to be positive, the algorithm provides a measure to see how close it is to this symmetry class. Moreover, the closest element of this class to it is also determined. This applies in cases where the tetrad is not ideal due to scattering of its measurement. The algorithm is entirely algebraic and applies to all symmetry classes, although the isotropic and the cubic class need a different treatment from all other classes.
No takes yet. Share an insight, caveat, or question.
Stahn et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: