Revision as of 16:57, 15 September 2004 editCharles Matthews (talk | contribs)Autopatrolled, Administrators360,392 editsm det← Previous edit | Revision as of 20:20, 25 September 2004 edit undoMathMartin (talk | contribs)4,455 editsm disambNext edit → | ||
Line 1: | Line 1: | ||
In ] and ], a '''Gramian matrix''' is a ] ] ] that can be used to test for ] of ]. 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 ]. 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> | ||
If the functions are linearly independent, then <math>G</math> is ]. Its ] is known as the '''Gram determinant'''. | If the functions are linearly independent, then <math>G</math> is ]. Its ] is known as the '''Gram determinant'''. |
Revision as of 20:20, 25 September 2004
In systems theory and linear algebra, a Gramian matrix is a real symmetric matrix that can be used to test for linear independence of functions. The Gramian matrix of a set of functions is defined as
If the functions are linearly independent, then is nonsingular. Its determinant is known as the Gram determinant.
In fact this is a special case of a quantitative measure of linear independence of vectors, available in any Hilbert space.
Categories: