In linear algebra, an orthogonal matrix is a square matrix with real entries whose columns and rows are orthogonal unit vectors (i.e., orthonormal vectors).
Equivalently, a matrix Q is orthogonal if its transpose is equal to its inverse:
which entails
where I is the identity matrix.
An orthogonal matrix Q is necessarily invertible (with inverse Q−1 = QT), unitary (Q−1 = Q*), and normal (Q*Q = QQ*). As a linear transformation, an orthogonal matrix preserves the dot product of vectors, and therefore acts as an isometry of Euclidean space, such as a rotation or reflection. In other words, it is a unitary transformation.
The set of n × n orthogonal matrices forms a group O(n), known as the orthogonal group. The subgroup SO(n) consisting of orthogonal matrices with determinant +1 is called the special orthogonal group, and each of its elements is a special orthogonal matrix. As a linear transformation, every special orthogonal matrix acts as a rotation.
The complex analogue of an orthogonal matrix is a unitary matrix.
Read more about Orthogonal Matrix: Overview, Examples, Spin and Pin, Rectangular Matrices
Famous quotes containing the word matrix:
“The matrix is God?
In a manner of speaking, although it would be more accurate ... to say that the matrix has a God, since this beings omniscience and omnipotence are assumed to be limited to the matrix.
If it has limits, it isnt omnipotent.
Exactly.... Cyberspace exists, insofar as it can be said to exist, by virtue of human agency.”
—William Gibson (b. 1948)