Misplaced Pages

Gram matrix: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 06:50, 25 March 2006 editCvalente (talk | contribs)64 editsmNo edit summary← Previous edit Revision as of 23:49, 15 April 2006 edit undoYurikBot (talk | contribs)278,165 editsm robot Adding: fr:Déterminant de GramNext edit →
Line 9: Line 9:
] ]
] ]

]

Revision as of 23:49, 15 April 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 { l i ( ) , i = 1 , , n } {\displaystyle \{l_{i}(\cdot ),\,i=1,\dots ,n\}} is defined as

G = [ G i j ] , G i j = t 0 t f l i ( τ ) l j ( τ ) d τ {\displaystyle G=,\,\,G_{ij}=\int _{t_{0}}^{t_{f}}l_{i}(\tau )l_{j}(\tau )\,d\tau }

The functions are linearly independent if and only if G {\displaystyle G} is nonsingular. Its determinant is known as the Gram determinant or Gramian.

In fact this is a special case of a quantitative measure of linear independence of vectors, available in any Hilbert space.

All eigenvalues of a Gramian matrix are real and non-negative and the matrix is thus also positive definite.

Categories: