A parallel algorithm for the unbalanced orthogonal Procrustes problem
Let \(A\in \mathbb{R}^{l\times m}\) and \(B\in \mathbb{R}^{l\times n}\) be two given matrices. The orthogonal Procrustes problem is to find the best least squares approximation of the matrix \(B\), with \(AQ\), among all possible matrices \(Q\in \mathbb{R}^{m\times n}\), with orthonormal columns. That is to say that the Procrustes problem is to find \(Q\) that achieves \(\min\| AQ-B\|\), where \(Q^ TQ=I\). A new algorithm for this problem is presented which is simpler than the existing one, and which uses the recursive singular value decomposition updates. The proposed algorithm can be efficiently implemented in a parallel environment. By using numerical experimental results, the author shows that the new algorithm has favorable convergence results.
- Algorithms for the orthographic-\(n\)-point problem
- The solution of orthogonal Procrustes problems for a family of orthogonally invariant norms
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem
- On a sub-Stiefel Procrustes problem arising in computer vision.
- Dual Algorithm for Orthogonal Procrustes Rotations
- An MM method for solving orthogonal unbalanced Procrustes problem
- A note on the orthogonal Procrustes problem and norm-dependent optimality
- Disentangling orthogonal matrices
- An eigenvalue-based method for the unbalanced Procrustes problem
- Numerical strategies for recursive least squares solutions to the matrix equation AX = B
- Successive projection method for solving the unbalanced Procrustes problem
This page was built for publication: A parallel algorithm for the unbalanced orthogonal Procrustes problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180610)
