Refresher - Inverse
Refresher
In linear algebra an n-by-n (square) matrix A is called invertible (some authors use nonsingular or nondegenerate) if there exists an n-by-n matrix B such that
AB=BA=In
where In denotes the n-by-n identitymatrix and the multiplication used is ordinary matrixmultiplication. If this is the case, then the matrix B is uniquely determined by A and is called the inverse of A, denoted by A−1. It follows from the theory of matrices that if
AB=I
A square matrix that is not invertible is called singular or degenerate. A square matrix is singular if and only if its determinant is 0.
If A=[abcd], the inverse is denoted by A-1. In order to be inverses, A?A-1=I, where I is the identity matrix.
In general, the inverse of the 2×2 matrix A=[abcd] is given by:
A-1= 1detA[d-b-ca] , where detA=ad-bc.
Note: This only works for 2 × 2 matrices.
Inversion of 3×3 matrices
A computationally efficient 3x3 matrix inversion is given by
A-1=[abcdefghk]-1=1det(A)[ABCDEFGHK]T=1det(A)[ADGBFKCFK]
where the determinant of A can be computed by applying the rule of Sarrus as follows:
det(A)=a(ek-fh)+b(fg-kd)+c(dh-eg)
If the determinant is non-zero, the matrix is invertible, with the elements of the above matrix on the right side given by
A=(ek-fh) D=(ch-bk) G=(bf-ce)
B=(fg-dk) E=(ak-cg) H=(cd-af)
C=(dh-eg) F=(db-ah) K=(ae,bd)