Matrices Flashcards
in terms of column vectors, Ax=b becomes
x1v1+x2v2+…+xnvn=b
for a 2x2 matrix, A, det(A) is
A11A22 - A12A21
for an n by n matrix, we calculate the determinant using
the laplace expansion
laplace expansion: what is j
any value between 1 and n
laplace expansion: what is Cij
the cofactor of matrix element Aij
laplace expansion: what is Mij
the minor
(det of A after row i and column j are removed)
det(A^T)=
det(A)
det(lambda A)=
lambda^n det(A) for an nxn matrix
det(AB)=
det(BA)=det(A)det(B)
effect on determinant when two rows/columns are interchanged
changes sign of det
if two rows/columns are multiples of each other then det =
0
multiplying a row by a non-zero scalar does what to det?
multiplies by same scalar
a square matrix is singular if
det(A)=0
a non-singular square matrix A has inverse A^-1, defined by
A^-1A = AA^-1 = I
where I is the identity matrix
inverse can be calculated by
A^-1=C^T/det(A)
(A^-1)^-1=
A
inverse of the transpose of A =
transpose of the inverse of A
(AB)^-1=
B^-1A^-1
DOES NOT EQUAL A^-1B^-1
det(A^-1(=
1/det(A)
the hermitian conjugate of a matrix is found by taking
the complex conjugate and the transpose
a matrix is hermitian if
it is equal to its hermitian conjugate
diagonal matrix
all non-diagonal elements are zero
upper triangular matrix
if Aij=0 for i>j
lower triangular matrix
if Aij=0 for i<j
symmetric matrix
equal to its transpose
normal matrix
if A^crossA=AA^cross
hermitian matrices are examples of these
orthogonal matrix
transpose is equal to the inverse
unitary matrix
A^cross = inverse
equivalent of orthogonal matrices for complex matrices
if for a non-zero vector, Ax=lambda x then
x is an eigenvector of A and lambda is the corresponding eigenvalue
any scalar multiple mu x of x is also
an eigenvector with the same eigenvalue
due to scalar multiple, it is more convenient to use
normalised eigenvectors (abs value of 1)
steps to calculate eigenvalues and eigenvectors
- rewrite eigenvalue equation in form (A-lambda I)x=0
- find characteristic equation det(A-lambda I)=0
- roots are eigenvalues
- sub eigenvalues back into first eqn for eigenvectors
- normalise eigenvectors if required