Positive semidefinite matrix
Definition
Let be an complex Hermitian matrix. The matrix is positive semidefinite when For a real symmetric , the condition is for all .
Remarks
is positive semidefinite if and only if all its eigenvalues are nonnegative. Each positive definite matrix is positive semidefinite. The matrix is positive semidefinite but not positive definite. The notation is common.
Explanations
L1 human
A positive semidefinite matrix never gives a negative value of . It may give zero for some nonzero vectors. Covariance matrices and Gram matrices are always of this kind.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
What this needs
To read this node, read these 6 nodes in this order. The foundations come first, and the list ends with this node.
- no evidence level
- Matrix definition
- Square matrix definition
- Transpose definition
- Conjugate transpose definition
- Hermitian matrix definition
- Positive semidefinite matrix definition
What depends on this
5 nodes use this node, directly or through other nodes.
- Singular value decomposition 000NPTMX6J
- Gram matrices are positive semidefinite 0AM050KCAW
- Polar decomposition 0J2C7BDJQA
- Singular value 0K2TX12X58
- Square root of a positive semidefinite matrix 0N5GP3YT8T
Sources
- Web https://en.wikipedia.org/wiki/Definite_matrix, Definitions
What links here
Used by
- Gram matrices are positive semidefinite 0AM050KCAW
- Square root of a positive semidefinite matrix 0N5GP3YT8T