Finding the optimal transformation(s) that makes two matrices as close as possible to each other.
This package supports general, generic, orthogonal, rotation, permutation, and symmetric Procrustes problems, including both the normal one-sided approach and (for orthogonal and permutation Procrustes) two-sided approaches, where both the rows and columns are transformed. Softassign algorithm is also implemented to solve two-sided permutation Procrustes.
