Solution methods to the nearest rotation matrix problem in R3: a comparative survey
Nowadays, the singular value decomposition (SVD) is the standard method of choice for solving the nearest rotation matrix problem. Nevertheless, many other methods are available in the literature for the 3D case. This article reviews the most representative ones, proposes alternative ones, and prese...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2023 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/443361 |
| Acceso en línea: | https://hdl.handle.net/2117/443361 https://dx.doi.org/10.1002/nla.2492 |
| Access Level: | acceso abierto |
| Palabra clave: | Numerical analysis Rotation matrices Quaternions Singular value decomposition Àlgebra lineal numèrica Classificació AMS::65 Numerical analysis::65F Numerical linear algebra Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica |
| Sumario: | Nowadays, the singular value decomposition (SVD) is the standard method of choice for solving the nearest rotation matrix problem. Nevertheless, many other methods are available in the literature for the 3D case. This article reviews the most representative ones, proposes alternative ones, and presents a comparative analysis to elucidate their relative computational costs and error performances. This analysis leads to the conclusion that some algebraic closed-form methods are as robust as the SVD, but significantly faster and more accurate. |
|---|