-
(i) The Gram–Schmidt process. This is probably the simplest and the easiest to compute. If the given matrix consists of three column vectors and (later referred to as primers) which are to be replaced by three column vectors and then the process is
As successive vectors are established, each vector v has subtracted from it its components in the directions of established vectors, and the remainder is normalized. The method will fail at the normalization step if the vectors v are not linearly independent. Otherwise, the process may be extended to any number of dimensions.
The weakness of the method is that, though differs from only in scale, may differ grossly from as the various columns are not treated equivalently.
-
(ii) A preferable method which treats all vectors equivalently is to iteratively replace the matrix M by .
Defining the residual matrix E as then on each iteration E is replaced by and convergence necessarily ensues.
-
(iii) A third method resolves M into its symmetric and antisymmetric parts and constructs an orthogonal matrix for which only S is altered. A determines l, m, n and θ as shown in Section 3.3.1.2.1, and from these a new S may be constructed.
-
(iv) A fourth method is to treat the general matrix M as a combination of pure strain and pure rotation. Setting with R orthogonal and T symmetrical gives
The rotation so found is the one which exactly superposes those three mutually perpendicular directions which remain mutually perpendicular under the transformation M.
is then the strain tensor of an unrotated body.
Writing , , may also be useful, in which is the strain tensor of a rotated body. See also Section 3.3.1.2.2 (iv).