Generalization of Euler Angles to N -Dimensional Orthogonal Matrices
The DOI matches its Crossref record; the references it cites are not checked yet.
Abstract
An algorithm is presented whereby an N-dimensional orthogonal matrix can be represented in terms of ½N(N − 1) independent parameters θk(ν)[ν=2,3,…,N;k=1,2,…,(ν−1)]. The parameters have the character of angles, whose compact domains are defined in a manner such that there exists a one-to-one correspondence between the points in the parameter space and the group of orthogonal matrices. Explicit formulas are given which express all matrix elements in terms of the angles, and formulas are given which express the angles in terms of the matrix elements. Special choices of angles give block-diagonal matrices. For three-dimensional matrices, the parametrization is equivalent to that of Euler.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Correspondingly, most of the experimental implementations so far have employed methods that better tolerate these fluctuations, such as Nelder-Mead and Particle-Swarm Optimization (PSO) 353 , which are gradient free. More recently the Simultaneous Perturbation Stochastic Approximation (SPSA) has been applied 354,355 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [355]
Citations
Cites
Untitled work
(1970) · Intern. J. Quantum Chem.
Unresolved
Cited by
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Fast and Robust Iterative Closest Point
Zhang, J., Yao, Y., & Deng, B. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3054619 · Cited by 343
“One possible parameterization of rigid transformations is to concatenate the translation vector and the Euler angles of the rotation [52], [53].”
MC-SCF. I. The multi-configuration self-consistent-field method
Hinze, J. (1973) · The Journal of Chemical Physics · doi:10.1063/1.1680022 · Cited by 341
Shrinkage Estimators for Covariance Matrices
Daniels, M. J., & Kass, R. E. (2001) · Biometrics · doi:10.1111/j.0006-341x.2001.01173.x · Cited by 247
“Since James and Stein (1961), many authors have explored better estimators for a covariance matrix.”
BackgroundThe von Mises–Fisher Matrix Distribution in Orientation Statistics
Khatri, C. G., & Mardia, K. V. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01610.x · Cited by 240
Metadata
- Authors
- Hoffman, D. K., Raffenetti, R. C., & Ruedenberg, K.
- Affiliations
- Iowa State University (US)
- ORCID
- Ruedenberg, Klaus
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 1972-04-01
- Volume
- 13
- Issue
- 4
- Pages
- 528-533
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W2061675032
- Cited by
- 69
- References
- 1
- Citations by year
- 2026: 2 · 2025: 3 · 2024: 1 · 2023: 6 · 2022: 1 · 2021: 4 · 2020: 2 · 2019: 6 · 2017: 3 · 2015: 2 · 2014: 3
- FWCI
- 2.15
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Journal of Mathematical Physics (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
- Physical Sciences › Mathematics › Geometry and Topology › Mathematics and Applications
- Keywords
- Euler angles, orthogonal matrices, block diagonal matrices, 3D rotation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Generalization of Euler Angles to N -Dimensional Orthogonal Matrices. https://app.cochat.ai/papers/10.1063/1.1666011
- The paper
- Hoffman, D. K., Raffenetti, R. C., & Ruedenberg, K. (1972). Generalization of Euler Angles to N -Dimensional Orthogonal Matrices. Journal of Mathematical Physics. https://doi.org/10.1063/1.1666011
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.