In linear algebra, a real invertible matrix A {\displaystyle A} is called a G-matrix if A − T = D 1 A D 2 {\displaystyle A^{-T}=D_{1}AD_{2}} (where A − T {\displaystyle A^{-T}} means ( A − 1 ) T {\displaystyle (A^{-1})^{T}} ) for some real diagonal matrices D 1 {\displaystyle D_{1}} and D 2 {\displaystyle D_{2}} . 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.
Properties All matrices below are assumed to be real square matrices.
If A {\displaystyle A} is a G-matrix, so are A T {\displaystyle A^{T}} and A − 1 {\displaystyle A^{-1}} . If A {\displaystyle A} is a G-matrix and D {\displaystyle D} is a nonsingular diagonal matrix, then both A D {\displaystyle AD} and D A {\displaystyle DA} are G-matrices. If A {\displaystyle A} is a G-matrix and P {\displaystyle P} is a permutation matrix, then both A P {\displaystyle AP} and P A {\displaystyle PA} are G-matrices. If A {\displaystyle A} is a G-matrix, then A {\displaystyle A} and A − T {\displaystyle A^{-T}} have the same entrywise zero pattern, i.e., A i j = 0 {\displaystyle A_{ij}=0} if and only if ( A − T ) i j = 0 {\displaystyle (A^{-T})_{ij}=0} . Thus the entrywise zero patterns of A {\displaystyle A} and A − 1 {\displaystyle A^{-1}} 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 C {\displaystyle C} such that C − 1 e {\displaystyle C^{-1}e} and C − T e {\displaystyle C^{-T}e} are entrywise nonzero is a G-matrix. Here e {\displaystyle e} denotes the vector of ones.
References
