|
Size: 1213
Comment: Initial commit
|
Size: 1348
Comment: Simplifying matrix page names
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 11: | Line 11: |
| == Symmetry == | == Idempotency == |
| Line 13: | Line 13: |
| A '''symmetric matrix''' is equal to its [[LinearAlgebra/MatrixTransposition|transpose]]. | An '''idempotent''' matrix can be multiplied by some matrix '''''A''''' any number of times and the first product will continue to be returned. In other words, '''''A'''^2^ = '''A'''''. |
| Line 15: | Line 15: |
| {{{ julia> A = [1 2; 2 1] 2×2 Matrix{Int64}: 1 2 2 1 |
For example, the [[LinearAlgebra/Projections|projection matrix]] '''''P''''' is characterized as '''H'''('''H'''^T^'''H''')^-1^'''H'''^T^. If this were squared to '''H'''('''H'''^T^'''H''')^-1^'''H'''^T^'''H'''('''H'''^T^'''H''')^-1^'''H'''^T^, then per the core principle of [[LinearAlgebra/MatrixInversion|inversion]] (i.e., '''''AA'''^-1^ = '''I'''''), half of the terms would cancel out. '''''P'''^2^ = '''P'''''. |
| Line 21: | Line 17: |
| julia> A == A' true }}} |
Only a square matrix can be idempotent. |
| Line 29: | Line 23: |
| == Invertability == | == Positive Definite == |
| Line 31: | Line 25: |
| A matrix '''''A''''' is '''invertible''' and '''non-singular''' if it can be [[LinearAlgebra/MatrixInversion|inverted]] into matrix '''''A'''^-1''. Not all matrices are invertible. ---- |
A '''positive definite matrix''' is a symmetric matrix where all [[LinearAlgebra/EigenvaluesAndEigenvectors|eigenvalues]] are positive. Following from the properties of all symmetric matrices, all pivots are also positive. Necessarily the [[LinearAlgebra/Determinants|determinant]] is also positive, and all subdeterminants are also positive. |
| Line 37: | Line 29: |
| == Idempotency == | |
| Line 39: | Line 30: |
| An '''idempotent''' matrix can be multiplied by some matrix '''''A''''' any number of times and the first product will continue to be returned. In other words, '''''A'''^2^ = '''A'''''. | === Positive Semi-definite === |
| Line 41: | Line 32: |
| For example, the [[LinearAlgebra/Projections|projection matrix]] '''''P''''' is characterized as '''H'''('''H'''^T^'''H''')^-1^'''H'''^T^. If this were squared to '''H'''('''H'''^T^'''H''')^-1^'''H'''^T^'''H'''('''H'''^T^'''H''')^-1^'''H'''^T^, then per the core principle of [[LinearAlgebra/MatrixInversion|inversion]] (i.e., '''''AA'''^-1^ = '''I'''''), half of the terms would cancel out. '''''P'''^2^ = '''P'''''. | A slight modification of the above requirement: 0 is also allowable. ---- CategoryRicottone |
Matrix Properties
Matrices can be categorized by whether or not they feature certain properties.
Idempotency
An idempotent matrix can be multiplied by some matrix A any number of times and the first product will continue to be returned. In other words, A2 = A.
For example, the projection matrix P is characterized as H(HTH)-1HT. If this were squared to H(HTH)-1HTH(HTH)-1HT, then per the core principle of inversion (i.e., AA-1 = I), half of the terms would cancel out. P2 = P.
Only a square matrix can be idempotent.
Positive Definite
A positive definite matrix is a symmetric matrix where all eigenvalues are positive. Following from the properties of all symmetric matrices, all pivots are also positive. Necessarily the determinant is also positive, and all subdeterminants are also positive.
Positive Semi-definite
A slight modification of the above requirement: 0 is also allowable.