Reduced Statistical Representation of Crystallographic Textures Based on Symmetry-Invariant Clustering of Lattice Orientations

: As proven in numerous experimental and theoretical studies, physical and mechanical properties of materials are determined by their internal structure. In the particular case of polycrystalline metals and alloys, an important role is given to the orientation distributions of crystalline lattices, or, in other words, crystallographic textures. Physically reasonable models of texture formation are highly demanded in modern Material Science and Engineering since they can provide an efﬁcient tool for designing polycrystalline products with improved operational characteristics. Models of interest can be obtained on the basis of statistical formulations of multilevel approaches and crystal elasto–visco–plasticity theories (in particular, Taylor–Bishop–Hill models and their various modiﬁcations are appropriate here). In such a framework, a representative volume element of a polycrystal is numerically implemented as a ﬁnite aggregate of crystallites (grains or subgrains) with a homogenized response at the macro-scale. Quantitative texture analysis of this aggregate requires estimating statistically stable features of the orientation distribution. The present paper introduces a clustering-based approach for executing this task with regard to preferred orientations. The proposed procedure operates with a weighted sample of orientations representing the aggregate and divides it into clusters, i.e., disjoint subsets of close elements. The closeness criterion is supposed to be deﬁned with the help of a special pseudometric distance, which takes rotational symmetry of the crystalline lattice into account. A speciﬁc illustrative example is provided for better understanding the developed procedure. The texture in the clustered aggregate can be described reductively in terms of effective characteristics of distinguished clusters. Several possible reduced-form representations are considered and investigated from the viewpoint of aggregating elastic properties in application to some numerically simulated textures.


Introduction
In a polycrystalline metal or alloy subject to severe plastic deformation, the internal structure evolves causing changes in material response at different scales. Depending on the loading process, its crystallites can rotate leading to inhomogeneity in the distribution of their lattice orientations. In such a case, it is said that a crystallographic texture is formed. This texture has significant influence on material properties at the macroscale and induces certain anisotropy in them. Texture prediction is of great interest in various simulations of technological operations since it makes possible to design materials with improved performance. A physically reasonable approach to describing quantitatively deformationbased processes with texture formation taken into consideration is to employ multilevel elasto-visco-plasticity models. Unlike common macrophenomenological theories, such models provide information on the internal state of a polycrystalline material being processed in terms of parameters characterizing key physical mechanisms (dislocation slips, grain reorientations, etc.) of inelastic deformation. Historically, this framework emerged evaluating ODFs by the inversion of diffraction pole figures [42,43]. It should be noted that expansions appropriate for statistical models, [22,27,28], usually require considering a quite large amount of series terms in order to adequately describe a sharp texture [43]. In discretization-based techniques, meshes adapted for typical textures in certain processes may be of interest. Such meshes can be obtained by identifying statistically preferred orientations (which are, in fact, local maximums of ODFs) in specially textured PAs. The method of texture components locally approximates an ODF in the neighborhoods of chosen orientations (or fibers) corresponded to these components. Since the amount and locations of the components for general textures are not known a priori, any application of the method, yet again, require preferred orientations to be identified. This task can be performed by involving some clustering techniques [44][45][46][47], which are presented in the paper.
The proposed approach is based on the statement that crystallites with close (in a certain formalizable sense) orientations contribute into aggregated material properties almost proportionally to their volumes. Such crystallites can be then grouped into a cluster, effective characteristics (conditional centers, total volume fraction of corresponded crystallites, etc.) of which can be used to describe the texture of the given PA in a reduced manner. In fact, each cluster defines a higher-density region in the space of orientations and hence can be considered as a peak-type texture component. For identifying them all, a heuristic clustering procedure is developed in this work and related ones [45,46]. It should be noted that the concept of closeness (or similarity) between elements is a crucial part in any clustering scheme. Since these elements are orientations of crystalline lattices, their rotational symmetry needs to be taken into account. This problem is resolved by introducing a symmetry-invariant pseudometric distance on the special orthogonal group, in virtue of which such orientations can be compared.
The paper is organized as follows. In Section 2, preliminaries are given: general definitions and notations are listed and a metric distance between orientations is introduced. For the sake of readability, some theoretical details of this section are placed in Appendices A and B. Section 3 is devoted to a thorough description of the proposed clustering procedure. In Section 4, examples of applying the developed procedure to reducing numerically simulated crystallographic textures are provided. Section 5 discusses adequacy of reduced texture representations and their similarities with certain statistical analogues from the viewpoint of aggregating material properties. The paper ends in Section 6 with a brief conclusion.

Preliminaries
Presentation of the work relies on some elements of Tensor Algebra [48,49], Theory of Groups [50] and Measure Theory [51,52]. For the sake of completeness, all necessary basic algebraic operations with tensors are listed in Appendix A. In this section, the space of crystalline lattice orientations is introduced in a formal manner and a pseudo-metrical distance between its elements is defined. Mathematical details are provided in Appendix B. Considerations related to the parametrization of such a space, its various topological properties and some statistical applications can be found in the references cited below and elsewhere [53,54].
In what follows, E 3 is the three-dimensional Euclidean space over the real field, R (the case of the complex field, C, is referred as E 3 (C)), with the dot product denoted by "·", and E (R) 3 is the space of R-rank tensors over E 3 . Let O + ⊂ E (2) 3 be the group of special orthogonal tensors. It is worthy to remind that O + is not a linear subspace of E (2) 3 since a linear combination of special orthogonal tensors generally is not a special orthogonal tensor. By definition, each r ∈ O + represents some rotation transform, r : E 3 → E 3 : (1) The choice of a parametrization on O + does not play a significant role in the paper. However, an opportunity to specify explicitly axes and angles of rotations as, e.g., in the case of quaternions [55] or neo-Eulerian parameters [22], seems to be of interest. The rotation around an axis vector a ∈ E 3 by an angle α ∈ R is further denoted by the tensor R α a ∈ O + . Within this work, O + is treated as the space of all orientations for a (three-dimensional) crystalline lattice. Each orientation can be described by a rotation to an actual position from some reference one, which is supposed to be the same for all orientations under consideration. In other words, if a laboratory coordinate system with the bi-orthogonal normalized basis vectors l 1 , l 2 , l 3 ∈ E 3 is fixed, then an arbitrary lattice orientation of a crystallite can be specified by the tensor o ∈ O + which rotates, under (1), these vectors to same-handed bi-orthogonal normalized basis vectors, k 1 , k 2 , k 3 ∈ E 3 , rigidly bound to the crystallite: With this in mind, tensors of O + are also termed as just orientations. An important question, especially in the context of clustering, is the way in which closeness of two arbitrary orientations, o I , o II ∈ O + , can be measured. Particular interest is addressed to the rotation between them, i.e., o II · o I (from o I to o II ) or o I · o II (vice versa), and the corresponding angle. When restricted to be in [0, π], this angle is actually the value of the metric distance d : O + × O + → [0, π] induced by the natural Riemann metrics. In terms of angles α, β ∈ [0, π] and axes a, b ∈ E 3 of orientations being compared, d can be represented as [41]: This expression can be computationally efficient when the quaternion-based [55] or Rodrigues [22] parametrizations is used on O + .
As it is already mentioned above, orientations of crystal lattices are of interest in this work. Since each lattice is characterized by a certain symmetry type, there are crystallographically indistinguishable orientations in O + . In other words, if S + ⊂ O + is a rotational symmetry group of a given lattice in its reference orientation, then an arbitrary orientation o ∈ O + of this lattice is symmetrically equivalent to all o · s such that s ∈ S + . Surely, a reasonable closeness criterion for lattice orientations should be introduced with this feature taken into consideration. In order to do so for clustering purposes, one can use the pseudometric distance d S + : O + × O + → [0, π] defined as follows: To eliminate non-uniqueness in the description of lattice orientations, one can narrow O + to a subset which contains exactly one orientation from each S + -equivalence class. The closure of such a subset is called a fundamental domain for S + . As for the representative elements, orientations with the least angles can be chosen in these classes [56].
where dS[a] is the area element of the unit sphere at the head point of a. By introducing special coordinate systems on O + , one can obtain volumetrically homogeneous parameter spaces for representing orientations. e.g., among neo-Eulerian spaces, such one is provided by homochoric coordinates [22]. It is worthy to mention that the spaces of Eulerian angles or angles specifying axis directions and rotation magnitudes are not homogeneous in this sense. By definition, F[O] determines the volume fraction of a crystal lattice, orientations of which are in O ∈ O + . If F is absolutely continuous [51] with respect to U, then it has the Radon-Nikodym derivative, f : O + → [0, +∞) , so that Such a function is defined up to U-null set and termed as an orientation distribution function (or density; ODF), e.g., the ODF, u, corresponding to U is a constant: it is also understood as the density of uniformly (i.e., equiprobable) distributed orientations. One should note that, in most applications, exactly ODFs are being considered. However, ODMs emerging in this work are not continuous in the given sense, so this term cannot be used in a rigorous manner. A simple example of such ODMs is the Dirac measure [52]. In what follows, ∆ o denotes the Dirac measure concentrated at o ∈ O + , which is defined by Due to ambiguity caused by symmetrically equivalent orientations, an ODM cannot be determined uniquely for every crystallographically non-uniform distribution. Given a symmetry group S + , this feature can be resolved, e.g., by imposing the following invariance conditions on each ODM, F: where O ∈ O + and s ∈ S + . Note that, in such a case, the domain of F can be reduced to the Borel sigma-algebra on O + S + . Since it is always possible to obtain a S + -invariant analogue of F by averaging over S + [50], restrictions of the form (9) are not applied to ODMs in the paper.

Crystallographic Texture Clustering
The following problem is considered in this section. Given a set of lattice orientations with known volume fractions of crystallites sharing same symmetry, split it into disjoint subsets such that elements of one subset are close to each other. Such a splitting is understood as crystallographic texture clustering (CTC) while the mentioned subsets are termed as clusters. In this work, CTC is of interest for identifying peak-type texture components in a PA.
Consider a single-phased PA of N crystallites with the rotational symmetry group ing exclusively orientations of the PA seems to be quite performant. In this connection, it is reasonable to introduce the so-called misorientation matrix, D (of N × N size): This is a symmetric matrix with main-diagonal elements equal to 0. A wide class of abstract clustering techniques can be executed by operating with only such an object (and, probably, corresponding fractions as well). The CTC procedure proposed in this paper shares common approaches with some well-known clustering algorithms [58,59], but also introduces certain modifications and generalizations (onto the case of unequal volume fractions).
In what follows in this section, main steps of the CTC procedure are demonstrated on the special sample of N = 300 orientations: R α 1 a , . . . , R α N a , which are parametrized by the same axis a ∈ E 3 and various angles α 1 , . . . , α N ∈ [0, π] marked on Figure 1. For simplicity, all volume fractions are supposed to be equal to each other; hence, f n = N −1 = 3.(3) · 10 −3 , n ∈ 1, N. The artificial symmetry with the non-trivial group S + = {I, R π a } is set in this example. Thus, in terms of a geometric analogy, elements of the exemplary sample can be treated as orientations of straight lines in the plane orthogonal to a.
This is a symmetric matrix with main-diagonal elements equal to 0. A wide class of abstract clustering techniques can be executed by operating with only such an object (and, probably, corresponding fractions as well). The CTC procedure proposed in this paper shares common approaches with some well-known clustering algorithms [58,59], but also introduces certain modifications and generalizations (onto the case of unequal volume fractions).
In what follows in this section, main steps of the CTC procedure are demonstrated on the special sample of  In the case of general textures, clusters are quite suppositional and their exact amount is not known a priori. To proceed correctly with clustering, it seems reasonable to identify In the case of general textures, clusters are quite suppositional and their exact amount is not known a priori. To proceed correctly with clustering, it seems reasonable to identify most densely located orientations. Such a density can be introduced with the help of certain weights attributed to the orientations. For each orientation, the weight is equal to the total volume fraction of crystallites with orientations within its some pseudometric neighborhood. Note that for small enough neighborhoods the mentioned weights and fractions are identical. Weights (ϕ 1 , . . . , ϕ N ) obtained for the exemplary sample of orientations are presented in Figure 2. most densely located orientations. Such a density can be introduced with the help of certain weights attributed to the orientations. For each orientation, the weight is equal to the total volume fraction of crystallites with orientations within its some pseudometric neighborhood. Note that for small enough neighborhoods the mentioned weights and fractions are identical. Weights (  1 ,, N ) obtained for the exemplary sample of orientations are presented in Figure 2. The step described above is equivalent to the evaluation of an especially mollified ODF at certain orientations. Indeed, let m be the mollifying function of the form II  II   II   1  I  I  II   I ,, ,  The step described above is equivalent to the evaluation of an especially mollified ODF at certain orientations. Indeed, let m be the mollifying function of the form where B ω o is the closed pseudometric ball centered at o ∈ O + of a radius ω > 0: The PA-induced ODM, F, is given by Mollifying it using m leads to the ODF f m : which returns the measure-related volume fractions of crystallites with orientations within the pseudometric ω-neighborhood of its argument. In the case when not the whole sample of orientations is taken into consideration, one should mollify only the sum of corresponding terms from (13). Note that practically reasonable values of ω are small enough to ensure that such neighborhood does not contain symmetrically equivalent orientations. If so, then this neighborhood can be treated as a metric one, which is defined with d instead of d S + in (12). For this case, it is easy to derive that [53]: Hereinafter, |X | denotes the amount of elements in a finite set X . The union of the densest neighborhoods forms a layer, which usually can be decomposed into distant (from each other) subsets of orientations. It is natural to consider these subsets as clusters. Appropriate techniques to identify them all within the layer are based on a reachability relation between orientations. Herein, the reachability is understood as the transitive closure of a adjacency relation, which can be introduced through operations over D and f 1 , . . . , f N . A possible formalization of such an approach is presented below in Algorithms 1 and 2.

Algorithm 1. Extracting a layer from a sample.
Parameters: • S, the index set defining the sample of orientations; • ω, the radius of pseudometric neighborhoods used in mollifying; • ϕ, the total fraction of the sample orientations in a neighborhood above which its content should be included in the layer. 1.
For each sample orientation, add the indexes of other sample orientations within its neighborhood to a set: For each sample orientation, calculate its weight, i.e., the total fraction of the sample orientations within its neighborhood: 3.
Add the indexes of the sample orientations within sufficiently dense neighborhoods to a set: Algorithm 1 allows a layer to be extracted with only a sample of orientations and corresponding fractions being considered. These orientations are supposed to be specified by some set of their indexes in the PA, S (e.g., the whole sample is given by S = {1, . . . , N ). The layer is defined as the union of neighborhoods centered at orientations with weights above a certain level, ϕ. There are different ways to set its value; in the example shown in Figure 3, ϕ is chosen among "locally maximal" weights, which are computed as the ones satisfying In general, each layer contains orientations with weights above a set level as well as orientations with weights equal or below it. Their subsets are further referenced as "core" and "periphery", respectively.

Algorithm 2.
Pre-clustering a layer by reachability. Parameters:   , the pseudometric distance between two orientations equal or below which they are considered as adjacent ones. 1. Add the index pairs for close orientations within the layer to a set (of edges): Algorithm 2 supposes that two orientations are adjacent if they are close enough to each other in terms of  d . In this case,  defines the lower bound for the distance between orientations of different clusters. There are also complicated variants of this relation, e.g. such ones which take intersection of corresponding neighborhoods into consideration. An example of clustering results for the described algorithm is given in Figure 4.

Algorithm 2.
Pre-clustering a layer by reachability.
Parameters: • ε, the pseudometric distance between two orientations equal or below which they are considered as adjacent ones. 1.
Add the index pairs for close orientations within the layer to a set (of edges): Divide the graph (V, E ) into the maximal connected subgraphs Algorithm 2 supposes that two orientations are adjacent if they are close enough to each other in terms of d S + . In this case, ε defines the lower bound for the distance between orientations of different clusters. There are also complicated variants of this relation, e.g., such ones which take intersection of corresponding neighborhoods into consideration. An example of clustering results for the described algorithm is given in Figure 4.
As an option for Algorithm 2, only core orientations of a layer being clustered can be taken into consideration. Each peripheral orientation then should be assigned to the leastdistant cluster. In such a case, the combination of Algorithms 1 and 2 is a sort of so-called density-based spatial clustering of applications with noise (DBSCAN) [60]. However, from the viewpoint of the complete CTC procedure, it seems reasonable to encapsulate their operational sequences.
With purpose to obtain well-localized clusters, one can employ additionally the medoid-based clustering. In common applications, the medoid of a finite set is understood as its element, such that the mean distance from this element to other elements in the set is minimal. When being applied to sets of orientations, this concept does not take into consideration volume fractions of corresponded crystallites and, therefore, should be modified. Note that, if all fractions for a given sample share a common factor, then this Crystals 2021, 11, 336 9 of 23 sample can be replaced by another one with equal fractions and repeating orientations. In such a connection, the following definition seems to be appropriate. An orientation of a finite set is its medoid if the mean pseudometric fraction-weighted distance from this orientation to other orientations of the set is minimal.
1. Add the index pairs for close orientations within the layer to a set (of edges): Algorithm 2 supposes that two orientations are adjacent if they are close enough to each other in terms of  d . In this case,  defines the lower bound for the distance between orientations of different clusters. There are also complicated variants of this relation, e.g. such ones which take intersection of corresponding neighborhoods into consideration. An example of clustering results for the described algorithm is given in Figure 4. As an option for Algorithm 2, only core orientations of a layer being clustered can be taken into consideration. Each peripheral orientation then should be assigned to the leastdistant cluster. In such a case, the combination of Algorithms 1 and 2 is a sort of so-called density-based spatial clustering of applications with noise (DBSCAN) [60]. However, from the viewpoint of the complete CTC procedure, it seems reasonable to encapsulate their operational sequences. In what follows, "←" denotes the assignment operation. Algorithm 3, which is presented below, performs the medoid-based clustering by alternating between determining medoids of current clusters and reassigning each orientation to the cluster with the closest medoid [58]. Given a fixed number of clusters, K, this subprocedure can be treated as a heuristic strategy for solving the discrete optimization problem: find index subsets C 1 , . . . , C K ⊂ S (or some Boolean variables describing the orientation-cluster assignment) and indexes m 1 , . . . , m K ∈ 1, N such that the objective reaches its minimum and wherein In fact, (21) gives an internal criterion of clustering quality. One should note that this approach provides generally only a suboptimal (i.e., unimprovable by any further iterations) solution. There are also other possible optimization techniques; e.g., the alternative algorithm [61] or the combinatorial global minimization method [62]. Optional steps can be included to control sizes or localizations of clusters being obtained. In Algorithm 3, it is proposed to split (in a heuristic manner) the least localized cluster in half with the medoid-based clustering subprocedure being repeated after each splitting.
Rigorously, weights used in (31) should be recalculated with only orientations of the layer (i.e., without orientations of the rest sample) being taken into consideration. However, such a recalculation does not affect core orientations, among which the medoids of split-induced clusters will be found most likely. • δ, the mean pseudometric deviation of cluster orientations from the medoid equal or above which the cluster should be split. 1.
For each initial cluster, find its medoid: 2.
For each current medoid, update the corresponding cluster by reassigning orientations to which this medoid is the closest one (among other medoids): 3.
For each current cluster, update its medoid: 4.
If at least one of m 1 , . . . , m K is changed at Step 3, go to Step 2.

5.
Find the cluster with the largest fraction-weighted mean pseudometric deviation of its orientations from the medoid: 6. If the cluster determined by Step 5 is not well enough localized, i.e., 6.1. Replace its medoid by the pair of orientations with the largest weighted distance (with the amount of clusters increased by one): 6.2. Go to Step 2.
Convergence of Algorithm 3 is guaranteed by the fact that (21) cannot increase during Steps 2 and 3 while the non-decreasing at Step 6 amount of clusters is limited by the amount of orientations. However, iterations required for convergence and solution quality depend heavily on initial clusters (or medoids) used in the algorithm as a first approximation. Estimates for them are just being provided by Algorithm 2, so the corresponding stage is termed as "pre-clustering". In its turn, Algorithm 3 refines the partitioning obtained in such a way and therefore is referenced as "post-clustering". Figure 5 illustrates results of this algorithm in application to the example being tracked. Rigorously, weights used in (31) should be recalculated with only orientations of the layer (i.e., without orientations of the rest sample) being taken into consideration. However, such a recalculation does not affect core orientations, among which the medoids of split-induced clusters will be found most likely.
Convergence of Algorithm 3 is guaranteed by the fact that (21) cannot increase during Steps 2 and 3 while the non-decreasing at Step 6 amount of clusters is limited by the amount of orientations. However, iterations required for convergence and solution quality depend heavily on initial clusters (or medoids) used in the algorithm as a first approximation. Estimates for them are just being provided by Algorithm 2, so the corresponding stage is termed as "pre-clustering". In its turn, Algorithm 3 refines the partitioning obtained in such a way and therefore is referenced as "post-clustering". Figure 5 illustrates results of this algorithm in application to the example being tracked. A layer extracted by Algorithm 1 and successively clustered by Algorithms 2 and 3 is then excluded from the sample. After that, the remaining sample is used for obtaining the next layer to be clustered. These steps are executed until there are no orientations left in the sample. The complete operation sequence with the whole sample being initial one A layer extracted by Algorithm 1 and successively clustered by Algorithms 2 and 3 is then excluded from the sample. After that, the remaining sample is used for obtaining the next layer to be clustered. These steps are executed until there are no orientations left in the sample. The complete operation sequence with the whole sample being initial one is described briefly in Algorithm 4 and schemed in Figure 6. Note that it is algorithmically possible to separate sample layering from clustering so each layer can be procedured independently.  is described briefly in Algorithm 4 and schemed in Figure 6. Note that it is algorithmically possible to separate sample layering from clustering so each layer can be procedured independently.

Algorithm 4.
Clustering the whole sample.

8.
10. If  then go to Step 3. On the basis of such data, various reduced representations of crystallographic textures can be constructed for their further analysis. Note that orientations in the initial sample are not assumed to be within any fundamental domain. However, for possible visualization purposes, it is reasonable to preliminary project them onto   .

Some Numerical Results
The proposed CTC procedure was implemented (in the form of C++ libraries) and then applied to investigate some deformation textures simulated with the help of the multilevel crystal elasto-visco-plasticity model [63]. The verification of this model showed satisfactory agreement with experimental data. Results for two numerical tests are presented in this work. In each case, a PA of On the basis of such data, various reduced representations of crystallographic textures can be constructed for their further analysis. Note that orientations in the initial sample are not assumed to be within any fundamental domain. However, for possible visualization purposes, it is reasonable to preliminary project them onto O + S + .

Some Numerical Results
The proposed CTC procedure was implemented (in the form of C++ libraries) and then applied to investigate some deformation textures simulated with the help of the multilevel crystal elasto-visco-plasticity model [63]. The verification of this model showed satisfactory agreement with experimental data. Results for two numerical tests are presented in this work. In each case, a PA of N = 1000 copper (cubic symmetry) equal-volume crystallites after a kinematic loading along a trajectory with two active stages is considered. The first stages of both tests are described by the same velocity gradient tensor L I ∈ E L I = 0.5 · 10 −3 (−l 1 l 1 + l 2 l 2 + l 1 l 2 − l 2 l 1 ); (32) while the second ones are preceded by elastic unloadings (which do not affect the textures) and are determined by the different tensors L II 1 , L II 2 ∈ E (2)
Obtained orientation distribution data sets are depicted in figures below by using the Rodrigues parametrization on O + S + . This representation is obtainable with the help of the mapping R : O + → E 3 defined as The orientational space of interest is the image R O + S + , which turns out to be a polyhedron for finite symmetry groups. Indeed, each R ω u ∈ S + confines fundamental Rodrigues vectors to be between the following pair of planes (see Appendix B): Particularly, in the case of cubic symmetry, R O + S + is the truncated cube, faces of which are orthogonal to the 100 and 111 axes, and located at distances of √ 2 − 1 and √ 3/3 from the origin, respectively. Figures 7a and 8a show fundamental orientations of the textured PAs obtained in Tests 1 and 2. Their complete samples were processed using the CTC procedure with the following parameters (for both tests): ω = ε = δ/2 = 5 • ; layer extractions were performed with values of ϕ chosen in the same way as for the exemplary sample considered in Section 4. The resulted reduced representations of the textures are given in Figures 7b and 8b in the form of medoids weighted by the total volume fractions (TVFs) of crystallites with orientations in the corresponded clusters. Amounts of layers distinguished for Test 1 and 2 are 19 and 14, respectively. Orientations of the lowest layers, which appear to be isolated, are omitted in the figures (8.7% and 6% of the whole samples by the corresponding TVFs).   Diagrams for the instances of the CTC procedure showing the amount of clusters at the extracted layers versus the TVF of crystallites corresponded to orientations of these layers are provided in Figure 9. One can observe that for lower layers the amount of distinguished clusters increase dramatically as new layers are clustered. Thus, in order to achieve a good data reduction effect, it may be reasonable to restrict consideration to only few upper layers. Adequacy of representations emerging in such a way is discussed in Section 5.1. As a possible option for obtaining better data reduction, which seems to be especially relevant for weak textures, a subsample of statistically uniformly distributed orientations [54] can be preliminary filtered out (with the help of some auxiliary subprocedure) from a given sample. This subsample then can be effectively described by the TVF of corresponded crystallites and excluded from the sample in subsequent clustering. Diagrams for the instances of the CTC procedure showing the amount of clusters at the extracted layers versus the TVF of crystallites corresponded to orientations of these layers are provided in Figure 9. One can observe that for lower layers the amount of distinguished clusters increase dramatically as new layers are clustered. Thus, in order to achieve a good data reduction effect, it may be reasonable to restrict consideration to only few upper layers. Adequacy of representations emerging in such a way is discussed in Section 5.1. As a possible option for obtaining better data reduction, which seems to be especially relevant for weak textures, a subsample of statistically uniformly distributed orientations [54] can be preliminary filtered out (with the help of some auxiliary subprocedure) from a given sample. This subsample then can be effectively described by the TVF of corresponded crystallites and excluded from the sample in subsequent clustering.

Adequacy Estimations
The crystallographic texture of a clustered PA can be represented reductively by using local approximations for orientation distribution in its clusters. One of the simplest examples of a reduced ODM, r F , in the notations of Section 3 is given by In some cases, especially for wide clusters, more complicated variants may be used

Adequacy Estimations
The crystallographic texture of a clustered PA can be represented reductively by using local approximations for orientation distribution in its clusters. One of the simplest examples of a reduced ODM, F r , in the notations of Section 3 is given by In some cases, especially for wide clusters, more complicated variants may be used instead of the Dirac measures to approximate texture components. Various unimodal model functions are applicable for this purpose, e.g., those ones [35][36][37][38][39][40][41]46]. To estimate their parameters, statistical approaches can be employed. Note that a correct estimation expects orientations in each cluster to be the least deviated among their symmetric analogues from the corresponding medoid. Thus, some rearrangements in the sample of orientations are generally necessary: An important question here is the adequacy of such reduced representations. In practical applications, ODMs are usually required for aggregating various material properties.
Let F be the ODM of a single-phased polycrystalline RVE and χ # ∈ E (R) 3 (R ∈ {0, 1, . . .}) be the tensor describing some characteristic of the crystalline lattice in its reference orientation. According to first-order homogenization theories, one can obtain an effective analogue, 3 , of this characteristic for the whole RVE by averaging: The integrand in (39) corresponds to the property tensor of a crystalline lattice oriented by o. The main thesis here is that every PA-induced ODM can be compared with its some reduced form in terms of, particularly, the differences in averaging certain material properties. In fact, such an approach introduces an external criterion of clustering quality.
For the textured PAs considered in Section 4, relative errors of representing ODMs in several reduced forms were evaluated from the viewpoint of elasticity. The results are described below within this subsection. Let π # ∈ E (4) 3 be the elasticity tensor of the crystalline lattice in the reference position (with independent components being, in GPa, π # 1111 = 168.4, π # 1122 = 121.4, π # 1212 = 75.4 with respect to the corresponding basis). Aggregating this property by applying F r as a ODM instead of F, leads to a change in the result, which can be estimated by the ratio [64] Herein, Π is the minimum non-zero eigenvalue of the unreduced effective elasticity tensor Π: and A r is the maximum modulo eigenvalue of the residual tensor A r defined by where Π r is the reduced effective elasticity tensor The designated eigenvalues are understood with respect to the problem of finding, for arbitrary t ∈ E 3 , such t ∈ C and s ∈ E The value of (40) characterizes the maximum relative error which occurs in the stress tensor determined by the generalized Hooke's law when Π is approximated by Π r . Note that since the exact orientation distribution laws for the PAs are not known a priori (it is possible to only estimate them statistically), F in the evaluations of Π was set to the corresponding PA-induced ODMs. Figure 10 shows dependencies of RE r for the mentioned PAs on the amountL of upper sample layers considered as clustered ones. The contribution of such layers into each reduced ODM is adopted from (37), while the rest ones are treated by using the following three generally different approaches.

1.
Orientations of the rest layers are taken into consideration without any data reductions, i.e., just like in a PA-induced ODM. In such a way, these reduced ODMs arise: 2.
The rest layers are simply excluded from consideration. In this case, total volume fraction of crystallites corresponded to the remaining orientations requires renormalization so the reduced ODMs are: 3.
Orientations of the rest layers are taken as uniformly distributed ones providing the following reduced ODMs: Since the reduced-form ODMs listed above are identical to each other whenL = L, the shown plots meet at the corresponding points. It is observed that texture representations given by (47) turn out to be more accurate (with respect to aggregating elastic characteristics) than ones for (46) while their data reduction effects are almost the same. Since the reduced-form ODMs listed above are identical to each other when  LL , the shown plots meet at the corresponding points. It is observed that texture representations given by (47) turn out to be more accurate (with respect to aggregating elastic characteristics) than ones for (46) while their data reduction effects are almost the same.

An Application to Approximating Orientation Distribution Functions for Generating Textured Polycrystalline Aggregates
Peak-type texture components identified by the CTC procedure and approximated with the help of some model functions provide an estimated ODF, which can be used for generating correspondingly textured PAs. Particularly, such a task is of interest in numerical investigations (on the basis of statistical multilevel polycrystalline models) of processes related to thermo-mechanical treatment of initially textured materials. In this subsection, comparison between the PAs considered in the above examples and random PAs generated with respect to the estimated ODFs is performed.
The generating ODFs were chosen to be of the form The left term of (48) corresponds, if (38) is applied, to a special case of the von Mises-Fisher distribution [53], while the right term contributes with uniformly distributed orientations. Such ODFs can be easily identified since all necessary pseudometric distance statistics are obtainable directly from the CTC procedure. Just like in (45)

An Application to Approximating Orientation Distribution Functions for Generating Textured Polycrystalline Aggregates
Peak-type texture components identified by the CTC procedure and approximated with the help of some model functions provide an estimated ODF, which can be used for generating correspondingly textured PAs. Particularly, such a task is of interest in numerical investigations (on the basis of statistical multilevel polycrystalline models) of processes related to thermo-mechanical treatment of initially textured materials. In this subsection, comparison between the PAs considered in the above examples and random PAs generated with respect to the estimated ODFs is performed.
The generating ODFs were chosen to be of the form where κ 1 1 , . . . , κ L−1 K L−1 ≥ 0 are scatter parameters estimated independently in each cluster by the maximum log-likelihood method and I n is the n-th modified Bessel function. The left term of (48) corresponds, if (38) is applied, to a special case of the von Mises-Fisher distribution [53], while the right term contributes with uniformly distributed orientations. Such ODFs can be easily identified since all necessary pseudometric distance statistics are obtainable directly from the CTC procedure. Just like in (45)-(47),L specifies the amount of layers taken as clustered ones. An artificially generated PA of N g crystallites with orientations o g 1 , . . . , o g N g ∈ O + and equal (for simplicity) volume fractions can be compared with a given PA in terms of elastic properties aggregated with their induced ODMs. Herein, the difference in the aggregation results is estimated by where A g is the maximum modulo eigenvalue of the residual tensor A g defined by and F g is the ODM induced by the generated PA: For both PAs given in the examples, 20 random realizations of PAs with N g = N = 1000 crystallites were constructed for each admissibleL by using f r L for sampling orientations. Obtained values of RE g are plotted below in Figure 11.
where g Α is the maximum modulo eigenvalue of the residual tensor g A defined by and g F is the ODM induced by the generated PA: One can notice that the dependencies established for the mean values of g RE provide statistical estimates for the adequacy of the reduced texture representations given by (48). Such representations are similar to (47), but rely on certain continuous local approximations of texture components instead of simple medoid-concentrated ones. It appears, however, that the applied approximating functions do not improve accuracy. Such a circumstance is due to the independence these functions on axes of rotations to their maximum points. Thus, morphology of obtained clusters is not taken into consideration, as it can be observed from Figure 12, where corresponding typical samples of random orientations are depicted for  1 LL . In order to eliminate this feature, one can employ the anisotropic component functions [39,53]. Nonetheless, from the viewpoint of aggregating elastic properties, generated PAs turn out to be satisfactory close to the given ones. One can notice that the dependencies established for the mean values of RE g provide statistical estimates for the adequacy of the reduced texture representations given by (48). Such representations are similar to (47), but rely on certain continuous local approximations of texture components instead of simple medoid-concentrated ones. It appears, however, that the applied approximating functions do not improve accuracy. Such a circumstance is due to the independence these functions on axes of rotations to their maximum points. Thus, morphology of obtained clusters is not taken into consideration, as it can be observed from Figure 12, where corresponding typical samples of random orientations are depicted forL = L − 1. In order to eliminate this feature, one can employ the anisotropic component functions [39,53]. Nonetheless, from the viewpoint of aggregating elastic properties, generated PAs turn out to be satisfactory close to the given ones.

Conclusions
To sum up, the problem of reducing orientation distribution data for a textured polycrystalline aggregate in considered within this paper. In order to perform such a reduction, an approach based on identifying statistically preferred crystalline orientations in a given fraction-weighted (by volumes of corresponded crystallites) sample is proposed. The procedure developed for executing this task is described in details. Its algorithm includes several logically separate stages, which divide the sample into distinct subsets of close orientations with the help of various techniques of Cluster Analysis. These stages, briefly characterized as "layer extracting", "pre-clustering", and "post-clustering", complement each other providing heuristically sensible partitions at different distribution density levels. The mentioned concept of closeness between orientations is introduced with lattice symmetry of crystallites taken into consideration. For this purpose, the special comparison function equal to the minimal rotation angle between symmetrical equivalents of argument orientations is defined. It turns out that such a function corresponds to a symmetry-invariant pseudometric distance induced by the natural Riemann metrics. Since all algorithms formulated in the work operate with orientations belonging exclusively to the sample, it is reasonable to pre-compute and tabulate the distances between them, obtaining thereby the so-called misorientation matrix.
The results of applying the developed clustering procedure to reducing two numerically simulated (in deformation tests) crystallographic textures are given for demonstration purposes. Three approaches to define a reduced-form orientation distribution measure are considered and juxtaposed with each other in terms of aggregating elastic characteristics. It is observed that clustering-based texture representations are able to provide adequate responses using a relatively small (compared to the amount of crystallites in the aggregates) amount of clusters. In addition, local orientation distributions within each obtained cluster are estimated statistically in the form of the von Mises-Fisher distribution by employing the maximum log-likelihood method. Distributions estimated in such a way can be used in generating correspondingly textured polycrystalline aggregates for various applications. Comparisons between the given and generated aggregates are performed analogically to the case of juxtaposing with reduced representations.
In the problems related to the design of functional polycrystalline materials, a great amount of degrees of freedom is a common issue. The proposed clustering procedure

Conclusions
To sum up, the problem of reducing orientation distribution data for a textured polycrystalline aggregate in considered within this paper. In order to perform such a reduction, an approach based on identifying statistically preferred crystalline orientations in a given fraction-weighted (by volumes of corresponded crystallites) sample is proposed. The procedure developed for executing this task is described in details. Its algorithm includes several logically separate stages, which divide the sample into distinct subsets of close orientations with the help of various techniques of Cluster Analysis. These stages, briefly characterized as "layer extracting", "pre-clustering", and "post-clustering", complement each other providing heuristically sensible partitions at different distribution density levels. The mentioned concept of closeness between orientations is introduced with lattice symmetry of crystallites taken into consideration. For this purpose, the special comparison function equal to the minimal rotation angle between symmetrical equivalents of argument orientations is defined. It turns out that such a function corresponds to a symmetry-invariant pseudometric distance induced by the natural Riemann metrics. Since all algorithms formulated in the work operate with orientations belonging exclusively to the sample, it is reasonable to pre-compute and tabulate the distances between them, obtaining thereby the so-called misorientation matrix.
The results of applying the developed clustering procedure to reducing two numerically simulated (in deformation tests) crystallographic textures are given for demonstration purposes. Three approaches to define a reduced-form orientation distribution measure are considered and juxtaposed with each other in terms of aggregating elastic characteristics. It is observed that clustering-based texture representations are able to provide adequate responses using a relatively small (compared to the amount of crystallites in the aggregates) amount of clusters. In addition, local orientation distributions within each obtained cluster are estimated statistically in the form of the von Mises-Fisher distribution by employing the maximum log-likelihood method. Distributions estimated in such a way can be used in generating correspondingly textured polycrystalline aggregates for various applications. Comparisons between the given and generated aggregates are performed analogically to the case of juxtaposing with reduced representations.
In the problems related to the design of functional polycrystalline materials, a great amount of degrees of freedom is a common issue. The proposed clustering procedure seems to be useful in this regard. With its help, typical most intensive texture components can be