Revision as of 15:11, 5 May 2006 editCharles Matthews (talk | contribs)Autopatrolled, Administrators360,392 editsm typo← Previous edit | Revision as of 15:12, 5 May 2006 edit undoCharles Matthews (talk | contribs)Autopatrolled, Administrators360,392 editsm typoNext edit → | ||
Line 7: | Line 7: | ||
:''x<sub>1</sub>,..., x<sub>n</sub>'' | :''x<sub>1</sub>,..., x<sub>n</sub>'' | ||
are ''n'' vectors of ''E'', the asociated '''Gram matrix''' is the |
are ''n'' vectors of ''E'', the asociated '''Gram matrix''' is the symmetric matrix | ||
:''(x<sub>i</sub>|x<sub>j</sub>)''. | :''(x<sub>i</sub>|x<sub>j</sub>)''. |
Revision as of 15:12, 5 May 2006
In systems theory and linear algebra, a Gramian matrix is a real-valued symmetric matrix that can be used to test for linear independence of functions. The Gramian matrix of a set of functions is defined as
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
- x1,..., xn
are n vectors of E, the asociated Gram matrix is the symmetric matrix
- (xi|xj).
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.
Categories: