This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Semi-orthogonal matrix" – news · newspapers · books · scholar · JSTOR (February 2014) (Learn how and when to remove this message) |
In linear algebra, a semi-orthogonal matrix is a non-square matrix with real entries where: if the number of columns exceeds the number of rows, then the rows are orthonormal vectors; but if the number of rows exceeds the number of columns, then the columns are orthonormal vectors.
Equivalently, a non-square matrix A is semi-orthogonal if either
In the following, consider the case where A is an m × n matrix for m > n. Then
The fact that implies the isometry property
- for all x in R.
For example, is a semi-orthogonal matrix.
A semi-orthogonal matrix A is semi-unitary (either AA = I or AA = I) and either left-invertible or right-invertible (left-invertible if it has more rows than columns, otherwise right invertible). As a linear transformation applied from the left, a semi-orthogonal matrix with more rows than columns preserves the dot product of vectors, and therefore acts as an isometry of Euclidean space, such as a rotation or reflection.
References
- Abadir, K.M., Magnus, J.R. (2005). Matrix Algebra. Cambridge University Press.
- Zhang, Xian-Da. (2017). Matrix analysis and applications. Cambridge University Press.
- Povey, Daniel, et al. (2018). "Semi-Orthogonal Low-Rank Matrix Factorization for Deep Neural Networks." Interspeech.
This article about matrices is a stub. You can help Misplaced Pages by expanding it. |