This is an old revision of this page, as edited by Vanish2 (talk | contribs) at 20:40, 24 June 2007 (added para on general forms). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 20:40, 24 June 2007 by Vanish2 (talk | contribs) (added para on general forms)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)In systems theory and linear algebra, the Gramian matrix of a set of functions is a real-valued symmetric matrix , where .
The Gramian matrix can be used to test for linear independence of functions. Namely, the functions are linearly independent if and only if is nonsingular. Its determinant is known as the Gram determinant or Gramian.
It is named for Jørgen Pedersen Gram.
In fact this is a special case of a quantitative measure of linear independence of vectors, available in any Hilbert space. According to that definition, for E a real prehilbert space, if
are n vectors of E, the associated Gram matrix is the symmetric matrix
- .
The Gram determinant is the determinant of this matrix,
All eigenvalues of a Gramian matrix are real and non-negative and the matrix is thus also positive semidefinite.
For a general bilinear form B on a finite-dimensional vector space over any field we can define a Gram matrix G attached to a basis by
- .
The matrix will be symmetric if the bilinear form B is. Under change of basis represented by an invertible matrix P, the Gram matrix will change by a matrix congruence to .