G-matrix
In linear algebra, a real invertible matrix is called a G-matrix if
(where
means
) for some real diagonal matrices
and
.
The term "G-matrix" was coined by Miroslav Fiedler and Frank J. Hall. It is sometimes called a semi-orthogonal matrix in research literature, although the latter term may also refer to a different kind of matrix, namely, a non-square matrix with orthogonal columns/rows.
All real orthogonal matrices and real invertible diagonal matrices, for instances, are G-matrices.
01Properties
All matrices below are assumed to be real square matrices.
- If
is a G-matrix, so are
and
.
- If
is a G-matrix and
is a nonsingular diagonal matrix, then both
and
are G-matrices.
- If
is a G-matrix and
is a permutation matrix, then both
and
are G-matrices.
- If
is a G-matrix, then
and
have the same entrywise zero pattern, i.e.,
if and only if
. Thus the entrywise zero patterns of
and
are symmetric to each other.
- The direct sum of G-matrices is again a G-matrix.
- Compound matrices of a G-matrix are G-matrices.
- Kronecker products of G-matrices are G-matrices.
- Every nonsingular Cauchy matrix
such that
and
are entrywise nonzero is a G-matrix. Here
denotes the vector of ones.
Sources and credits
This article is adapted from the Wikipedia article “G-matrix”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.