Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Characterization and Computation of Matrices of Maximal Trace over Rotations

Published

Author(s)

Javier Bernal, James F. Lawrence

Abstract

The constrained orthogonal Procrustes problem is the least-squares problem that calls for a rotation matrix that optimally aligns two corresponding sets of points in d-dimensional Euclidean space. This problem generalizes to the so-called Wahba's problem which is the same problem with nonnegative weights. Given a d by d matrix M, solutions to these problems are intricately related to the problem of finding a d by d rotation matrix U that maximizes the trace of UM, i.e., that makes UM a matrix of maximal trace over rotations, and it is well known this can be achieved with a method based on the computation of the singular value decomposition (SVD) of M. In this paper, we analyze matrices of maximal trace and explore the possibility of identifying alternative ways, other than the SVD method, of obtaining solutions. As a result, we identify a characterization of these matrices that for d = 2, 3, can be used to determine whether a matrix is of maximal trace. We also identify an alternative way that does not involve the SVD method for solving 2-dimensional problems, and explore the possibility of doing the same in 3 dimensions.
Citation
Journal of Geometry and Symmetry in Physics
Volume
53

Keywords

constrained, eigen value, maximal trace, orthogonal, Procrustes, rotation, singular value decomposition, Wahba

Citation

Bernal, J. and Lawrence, J. (2019), Characterization and Computation of Matrices of Maximal Trace over Rotations, Journal of Geometry and Symmetry in Physics, [online], https://doi.org/10.7546/jgsp-53-2019-21-53 (Accessed April 13, 2024)
Created October 19, 2019, Updated April 25, 2020