\texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices
From MaRDI portal
Publication:2695590
DOI10.1016/j.cpc.2022.108334OpenAlexW4221040097WikidataQ114192692 ScholiaQ114192692MaRDI QIDQ2695590
Jonathan La, Paul W. Ayers, Fanwang Meng, Alireza Tehrani, Michael Richer, Farnaz Heidar Zadeh, Tae-Won Kim
Publication date: 31 March 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2022.108334
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Continuous generalized Proceustes analysis
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Orthogonal Procrustes rotation maximizing congruence
- The symmetric Procrustes problem
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- Generalized Procrustes analysis
- The invisible hand algorithm: solving the assignment problem with statistical physics
- Molecular alignment as a penalized permutation Procrustes problem
- Subspace Procrustes analysis
- Characterization and computation of matrices of maximal trace over rotations
- The \((M, N)\)-symmetric Procrustes problem
- Simultaneous singular value decomposition
- A generalized solution of the orthogonal Procrustes problem
- Learning to Rank for Information Retrieval
- An eigendecomposition approach to weighted graph matching problems
- Procrustes Problems
- Continuous Procrustes Distance Between Two Surfaces
- A Method for Solving Traveling-Salesman Problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices