Revision as of 17:03, 15 February 2007 editChnv (talk | contribs)209 edits "''the'' Gramian matrix"?← Previous edit | Revision as of 17:06, 15 February 2007 edit undoChnv (talk | contribs)209 editsm Link to "eigenvalues"Next edit → | ||
Line 21: | Line 21: | ||
(x_n|x_1) & (x_n|x_2) &\dots & (x_n|x_n)\end{vmatrix}</math> | (x_n|x_1) & (x_n|x_2) &\dots & (x_n|x_n)\end{vmatrix}</math> | ||
All |
All ]s of a Gramian matrix are real and non-negative and the matrix is thus also ]. | ||
Revision as of 17:06, 15 February 2007
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.