Revision as of 14:06, 15 September 2004 editTbackstr (talk | contribs)Extended confirmed users557 editsNo edit summary | Revision as of 16:48, 15 September 2004 edit undoCharles Matthews (talk | contribs)Autopatrolled, Administrators360,392 editsmNo edit summaryNext 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 nonsingular. | If the functions are linearly independent, then <math>G</math> is ]. | ||
] | ] |
Revision as of 16:48, 15 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.
Categories: