Revision as of 23:25, 14 May 2006 editTsca.bot (talk | contribs)12,824 editsm robot adding: pl← Previous edit | Revision as of 09:45, 6 August 2006 edit undoPlayingviolin1 (talk | contribs)56 editsNo edit summaryNext edit → | ||
Line 1: | Line 1: | ||
In ] and ], a '''Gramian matrix''' is a ] ] that can be used to test for ] of ]s. The Gramian matrix of a set of functions <math>\{l_i(\cdot),\,i=1,\dots,n\}</math> is defined as | In ] and ], a '''Gramian matrix''' is a ] ] that can be used to test for ] of ]s. The Gramian matrix of a set of functions <math>\{l_i(\cdot),\,i=1,\dots,n\}</math> is defined as: | ||
:<math>G=,\,\,G_{ij}=\int_{t_0}^{t_f} l_i(\tau)l_j(\tau)\, d\tau </math> | :<math>G=,\,\,G_{ij}=\int_{t_0}^{t_f} l_i(\tau)l_j(\tau)\, d\tau </math> | ||
The functions are linearly independent if and only if <math>G</math> is ]. Its ] is known as the '''Gram determinant''' or '''Gramian'''. It is named for ]. | The functions are linearly independent if and only if <math>G</math> is ]. Its ] is known as the '''Gram determinant''' or '''Gramian'''. It is named for ]. |
Revision as of 09:45, 6 August 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 associated 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: