Inverse functions and the identity function

In linear algebra, an n-by-n square matrix A is called invertible (also nonsingular or nondegenerate), if there exists an n-by-n square matrix B such that

$\mathbf {AB} =\mathbf {BA} =\mathbf {I} _{n}\$

where I_n denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix B is uniquely determined by A, and is called the (multiplicative) inverse of A, denoted by A⁻¹. Matrix inversion is the process of finding the matrix B that satisfies the prior equation for a given invertible matrix A.

A square matrix that is not invertible is called singular or degenerate. A square matrix is singular if and only if its determinant is zero. Singular matrices are rare in the sense that if a square matrix's entries are randomly selected from any finite region on the number line or complex plane, the probability that the matrix is singular is 0, that is, it will "almost never" be singular. Non-square matrices (m-by-n matrices for which m ≠ n) do not have an inverse. However, in some cases such a matrix may have a left inverse or right inverse. If A is m-by-n and the rank of A is equal to n (n ≤ m), then A has a left inverse, an n-by-m matrix B such that BA = I_n. If A has rank m (m ≤ n), then it has a right inverse, an n-by-m matrix B such that AB = I_m.

While the most common case is that of matrices over the real or complex numbers, all these definitions can be given for matrices over any ring. However, in the case of the ring being commutative, the condition for a square matrix to be invertible is that its determinant is invertible in the ring, which in general is a stricter requirement than being nonzero. For a noncommutative ring, the usual determinant is not defined. The conditions for existence of left-inverse or right-inverse are more complicated, since a notion of rank does not exist over rings.

The set of n × n invertible matrices together with the operation of matrix multiplication (and entries from ring R) form a group, the general linear group of degree n, denoted GL_n(R).

Properties

The invertible matrix theorem

Let A be a square n by n matrix over a field K (e.g., the field R of real numbers). The following statements are equivalent (i.e., they are either all true or all false for any given matrix):

A is invertible, that is, A has an inverse, is nonsingular, or is nondegenerate.

A is row-equivalent to the n-by-n identity matrix I_n.

A is column-equivalent to the n-by-n identity matrix I_n.

A has n pivot positions.

det A ≠ 0. In general, a square matrix over a commutative ring is invertible if and only if its determinant is a unit in that ring.

A has full rank; that is, rank A = n.

The equation Ax = 0 has only the trivial solution x = 0.

The kernel of A is trivial, that is, it contains only the null vector as an element, ker(A) = {0}.

The equation Ax = b has exactly one solution for each b in Kⁿ.

The columns of A are linearly independent.

The columns of A span Kⁿ.

Col A = Kⁿ.

The columns of A form a basis of Kⁿ.

The linear transformation mapping x to Ax is a bijection from Kⁿ to Kⁿ.

There is an n-by-n matrix B such that AB = I_n = BA.

The transpose A^T is an invertible matrix (hence rows of A are linearly independent, span Kⁿ, and form a basis of Kⁿ).

The number 0 is not an eigenvalue of A.

The matrix A can be expressed as a finite product of elementary matrices.

The matrix A has a left inverse (that is, there exists a B such that BA = I) or a right inverse (that is, there exists a C such that AC = I), in which case both left and right inverses exist and B = C = A⁻¹.

Other properties

Furthermore, the following properties hold for an invertible matrix A:

• (A⁻¹)⁻¹ = A;
• (kA)⁻¹ = k⁻¹A⁻¹ for nonzero scalar k;
• (Ax)⁺ = x⁺A⁻¹ if A has orthonormal columns, where ⁺ denotes the Moore–Penrose inverse and x is a vector;
• (A^T)⁻¹ = (A⁻¹)^T;
• For any invertible n-by-n matrices A and B, (AB)⁻¹ = B⁻¹A⁻¹. More generally, if A₁, ..., A_k are invertible n-by-n matrices, then (A₁A₂⋯A_k−1A_k)⁻¹ = A_k ⁻¹A_k−1 ⁻¹⋯A₂ ⁻¹A ₁ ⁻¹;
• det A⁻¹ = (det A)⁻¹.

The rows of the inverse matrix V of a matrix U are orthonormal to the columns of U (and vice versa interchanging rows for columns). To see this, suppose that UV = VU = I where the rows of V are denoted as $v_{i}^{\mathrm {T} }$ and the columns of U as $u_{j}$ for $1\leq i,j\leq n$. Then clearly, the Euclidean inner product of any two $v_{i}^{\mathrm {T} }u_{j}=\delta _{i,j}$. This property can also be useful in constructing the inverse of a square matrix in some instances, where a set of orthogonal vectors (but not necessarily orthonormal vectors) to the columns of U are known. In which case, one can apply the iterative Gram–Schmidt process to this initial set to determine the rows of the inverse V.

A matrix that is its own inverse (i.e., a matrix A such that A = A⁻¹ and A² = I), is called an involutory matrix.

In relation to its adjugate

The adjugate of a matrix $A$ can be used to find the inverse of $A$ as follows:

If $A$ is an invertible matrix, then

$A^{-1}={\frac {1}{\det(A)}}\operatorname {adj} (A).$

In relation to the identity matrix

It follows from the associativity of matrix multiplication that if

$\mathbf {AB} =\mathbf {I} \$

for finite square matrices A and B, then also

$\mathbf {BA} =\mathbf {I} \$

Density

Over the field of real numbers, the set of singular n-by-n matrices, considered as a subset of R^n×n, is a null set, that is, has Lebesgue measure zero. This is true because singular matrices are the roots of the determinant function. This is a continuous function because it is a polynomial in the entries of the matrix. Thus in the language of measure theory, almost all n-by-n matrices are invertible.

Furthermore, the n-by-n invertible matrices are a dense open set in the topological space of all n-by-n matrices. Equivalently, the set of singular matrices is closed and nowhere dense in the space of n-by-n matrices.

In practice however, one may encounter non-invertible matrices. And in numerical calculations, matrices which are invertible, but close to a non-invertible matrix, can still be problematic; such matrices are said to be ill-conditioned.

Examples

Consider the following 2-by-2 matrix:

$\mathbf {A} ={\begin{pmatrix}-1&{\tfrac {3}{2}}\\1&-1\end{pmatrix}}.$

The matrix $\mathbf {A}$ is invertible. To check this, one can compute that ${\textstyle \det \mathbf {A} =-{\frac {1}{2}}}$, which is non-zero.

As an example of a non-invertible, or singular, matrix, consider the matrix

$\mathbf {B} ={\begin{pmatrix}-1&{\tfrac {3}{2}}\\{\tfrac {2}{3}}&-1\end{pmatrix}}.$

The determinant of $\mathbf {B}$ is 0, which is a necessary and sufficient condition for a matrix to be non-invertible.

Methods of matrix inversion

Gaussian elimination

Gauss–Jordan elimination is an algorithm that can be used to determine whether a given matrix is invertible and to find the inverse. An alternative is the LU decomposition, which generates upper and lower triangular matrices, which are easier to invert.

Newton's method

A generalization of Newton's method as used for a multiplicative inverse algorithm may be convenient, if it is convenient to find a suitable starting seed:

$X_{k+1}=2X_{k}-X_{k}AX_{k}.$

Victor Pan and John Reif have done work that includes ways of generating a starting seed. Byte magazine summarised one of their approaches.

Newton's method is particularly useful when dealing with families of related matrices that behave enough like the sequence manufactured for the homotopy above: sometimes a good starting point for refining an approximation for the new inverse can be the already obtained inverse of a previous matrix that nearly matches the current matrix, for example, the pair of sequences of inverse matrices used in obtaining matrix square roots by Denman–Beavers iteration; this may need more than one pass of the iteration at each new matrix, if they are not close enough together for just one to be enough. Newton's method is also useful for "touch up" corrections to the Gauss–Jordan algorithm which has been contaminated by small errors due to imperfect computer arithmetic.

Cayley–Hamilton method

The Cayley–Hamilton theorem allows the inverse of $A$ to be expressed in terms of $\det(A)$, traces and powers of $A$:

$\mathbf {A} ^{-1}={\frac {1}{\det(\mathbf {A} )}}\sum _{s=0}^{n-1}\mathbf {A} ^{s}\sum _{k_{1},k_{2},\ldots ,k_{n-1}}\prod _{l=1}^{n-1}{\frac {(-1)^{k_{l}+1}}{l^{k_{l}}k_{l}!}}\operatorname {tr} \left(\mathbf {A} ^{l}\right)^{k_{l}},$

where $n$ is dimension of $A$, and $\operatorname {tr} (A)$ is the trace of matrix $A$ given by the sum of the main diagonal. The sum is taken over $s$ and the sets of all $k_{l}\geq 0$ satisfying the linear Diophantine equation

$s+\sum _{l=1}^{n-1}lk_{l}=n-1.$

The formula can be rewritten in terms of complete Bell polynomials of arguments $t_{l}=-(l-1)!\operatorname {tr} \left(A^{l}\right)$ as

$\mathbf {A} ^{-1}={\frac {1}{\det(\mathbf {A} )}}\sum _{s=1}^{n}\mathbf {A} ^{s-1}{\frac {(-1)^{n-1}}{(n-s)!}}B_{n-s}(t_{1},t_{2},\ldots ,t_{n-s}).$

Eigendecomposition

If matrix A can be eigendecomposed, and if none of its eigenvalues are zero, then A is invertible and its inverse is given by

$\mathbf {A} ^{-1}=\mathbf {Q} \mathbf {\Lambda } ^{-1}\mathbf {Q} ^{-1},$

where $\mathbf {Q}$ is the square (N×N) matrix whose i-th column is the eigenvector $q_{i}$ of $\mathbf {A}$, and $\mathbf {\Lambda }$ is the diagonal matrix whose diagonal elements are the corresponding eigenvalues, that is, $\Lambda _{ii}=\lambda _{i}$. If $\mathbf {A}$ is symmetric, $\mathbf {Q}$ is guaranteed to be an orthogonal matrix, therefore $\mathbf {Q} ^{-1}=\mathbf {Q} ^{\mathrm {T} }$. Furthermore, because $\mathbf {\Lambda }$ is a diagonal matrix, its inverse is easy to calculate:

$\left[\Lambda ^{-1}\right]_{ii}={\frac {1}{\lambda _{i}}}.$

Cholesky decomposition

If matrix A is positive definite, then its inverse can be obtained as

$\mathbf {A} ^{-1}=\left(\mathbf {L} ^{*}\right)^{-1}\mathbf {L} ^{-1},$

where L is the lower triangular Cholesky decomposition of A, and L* denotes the conjugate transpose of L.

Analytic solution

Writing the transpose of the matrix of cofactors, known as an adjugate matrix, can also be an efficient way to calculate the inverse of small matrices, but this recursive method is inefficient for large matrices. To determine the inverse, we calculate a matrix of cofactors:

$\mathbf {A} ^{-1}={1 \over {\begin{vmatrix}\mathbf {A} \end{vmatrix}}}\mathbf {C} ^{\mathrm {T} }={1 \over {\begin{vmatrix}\mathbf {A} \end{vmatrix}}}{\begin{pmatrix}\mathbf {C} _{11}&\mathbf {C} _{21}&\cdots &\mathbf {C} _{n1}\\\mathbf {C} _{12}&\mathbf {C} _{22}&\cdots &\mathbf {C} _{n2}\\\vdots &\vdots &\ddots &\vdots \\\mathbf {C} _{1n}&\mathbf {C} _{2n}&\cdots &\mathbf {C} _{nn}\\\end{pmatrix}}$

so that

$\left(\mathbf {A} ^{-1}\right)_{ij}={1 \over {\begin{vmatrix}\mathbf {A} \end{vmatrix}}}\left(\mathbf {C} ^{\mathrm {T} }\right)_{ij}={1 \over {\begin{vmatrix}\mathbf {A} \end{vmatrix}}}\left(\mathbf {C} _{ji}\right)$

where |A| is the determinant of A, C is the matrix of cofactors, and C^T represents the matrix transpose.

Inversion of 2 × 2 matrices

The cofactor equation listed above yields the following result for 2 × 2 matrices. Inversion of these matrices can be done as follows:

$\mathbf {A} ^{-1}={\begin{bmatrix}a&b\\c&d\\\end{bmatrix}}^{-1}={\frac {1}{\det \mathbf {A} }}{\begin{bmatrix}\,\,\,d&\!\!-b\\-c&\,a\\\end{bmatrix}}={\frac {1}{ad-bc}}{\begin{bmatrix}\,\,\,d&\!\!-b\\-c&\,a\\\end{bmatrix}}.$

This is possible because 1/(ad − bc) is the reciprocal of the determinant of the matrix in question, and the same strategy could be used for other matrix sizes.

The Cayley–Hamilton method gives

$\mathbf {A} ^{-1}={\frac {1}{\det \mathbf {A} }}\left[\left(\operatorname {tr} \mathbf {A} \right)\mathbf {I} -\mathbf {A} \right].$

Inversion of 3 × 3 matrices

A computationally efficient 3 × 3 matrix inversion is given by

$\mathbf {A} ^{-1}={\begin{bmatrix}a&b&c\\d&e&f\\g&h&i\\\end{bmatrix}}^{-1}={\frac {1}{\det(\mathbf {A} )}}{\begin{bmatrix}\,A&\,B&\,C\\\,D&\,E&\,F\\\,G&\,H&\,I\\\end{bmatrix}}^{\mathrm {T} }={\frac {1}{\det(\mathbf {A} )}}{\begin{bmatrix}\,A&\,D&\,G\\\,B&\,E&\,H\\\,C&\,F&\,I\\\end{bmatrix}}$

(where the scalar A is not to be confused with the matrix A).

If the determinant is non-zero, the matrix is invertible, with the elements of the intermediary matrix on the right side above given by

${\begin{alignedat}{6}A&={}&(ei-fh),&\quad &D&={}&-(bi-ch),&\quad &G&={}&(bf-ce),\\B&={}&-(di-fg),&\quad &E&={}&(ai-cg),&\quad &H&={}&-(af-cd),\\C&={}&(dh-eg),&\quad &F&={}&-(ah-bg),&\quad &I&={}&(ae-bd).\\\end{alignedat}}$

The determinant of A can be computed by applying the rule of Sarrus as follows:

$\det(\mathbf {A} )=aA+bB+cC.$

The Cayley–Hamilton decomposition gives

$\mathbf {A} ^{-1}={\frac {1}{\det(\mathbf {A} )}}\left({\frac {1}{2}}\left[(\operatorname {tr} \mathbf {A} )^{2}-\operatorname {tr} \mathbf {A} ^{2}\right]\mathbf {I} -\mathbf {A} \operatorname {tr} \mathbf {A} +\mathbf {A} ^{2}\right).$

The general 3 × 3 inverse can be expressed concisely in terms of the cross product and triple product. If a matrix $\mathbf {A} ={\begin{bmatrix}\mathbf {x} _{0}&\mathbf {x} _{1}&\mathbf {x} _{2}\end{bmatrix}}$ (consisting of three column vectors, $\mathbf {x} _{0}$, $\mathbf {x} _{1}$, and $\mathbf {x} _{2}$) is invertible, its inverse is given by

$\mathbf {A} ^{-1}={\frac {1}{\det(\mathbf {A} )}}{\begin{bmatrix}{(\mathbf {x_{1}} \times \mathbf {x_{2}} )}^{\mathrm {T} }\\{(\mathbf {x_{2}} \times \mathbf {x_{0}} )}^{\mathrm {T} }\\{(\mathbf {x_{0}} \times \mathbf {x_{1}} )}^{\mathrm {T} }\end{bmatrix}}.$

The determinant of A, $\det(\mathbf {A} )$, is equal to the triple product of $\mathbf {x_{0}}$, $\mathbf {x_{1}}$, and $\mathbf {x_{2}}$—the volume of the parallelepiped formed by the rows or columns:

$\det(\mathbf {A} )=\mathbf {x} _{0}\cdot (\mathbf {x} _{1}\times \mathbf {x} _{2}).$

The correctness of the formula can be checked by using cross- and triple-product properties and by noting that for groups, left and right inverses always coincide. Intuitively, because of the cross products, each row of $\mathbf {A} ^{-1}$ is orthogonal to the non-corresponding two columns of $\mathbf {A}$ (causing the off-diagonal terms of $\mathbf {I} =\mathbf {A} ^{-1}\mathbf {A}$ be zero). Dividing by

$\det(\mathbf {A} )=\mathbf {x} _{0}\cdot (\mathbf {x} _{1}\times \mathbf {x} _{2})$

causes the diagonal elements of $\mathbf {I} =\mathbf {A} ^{-1}\mathbf {A}$ to be unity. For example, the first diagonal is:

$1={\frac {1}{\mathbf {x_{0}} \cdot (\mathbf {x} _{1}\times \mathbf {x} _{2})}}\mathbf {x_{0}} \cdot (\mathbf {x} _{1}\times \mathbf {x} _{2}).$

Inversion of 4 × 4 matrices

With increasing dimension, expressions for the inverse of A get complicated. For n = 4, the Cayley–Hamilton method leads to an expression that is still tractable:

$\mathbf {A} ^{-1}={\frac {1}{\det(\mathbf {A} )}}\left({\frac {1}{6}}\left[(\operatorname {tr} \mathbf {A} )^{3}-3\operatorname {tr} \mathbf {A} \operatorname {tr} \mathbf {A} ^{2}+2\operatorname {tr} \mathbf {A} ^{3}\right]\mathbf {I} -{\frac {1}{2}}\mathbf {A} \left[(\operatorname {tr} \mathbf {A} )^{2}-\operatorname {tr} \mathbf {A} ^{2}\right]+\mathbf {A} ^{2}\operatorname {tr} \mathbf {A} -\mathbf {A} ^{3}\right).$

By Neumann series

If a matrix A has the property that

$\lim _{n\to \infty }(\mathbf {I} -\mathbf {A} )^{n}=0$

then A is nonsingular and its inverse may be expressed by a Neumann series:

$\mathbf {A} ^{-1}=\sum _{n=0}^{\infty }(\mathbf {I} -\mathbf {A} )^{n}.$

Truncating the sum results in an "approximate" inverse which may be useful as a preconditioner. Note that a truncated series can be accelerated exponentially by noting that the Neumann series is a geometric sum. As such, it satisfies

$\sum _{n=0}^{2^{L}-1}(\mathbf {I} -\mathbf {A} )^{n}=\prod _{l=0}^{L-1}\left(\mathbf {I} +(\mathbf {I} -\mathbf {A} )^{2^{l}}\right)$.

Therefore, only $2L-2$ matrix multiplications are needed to compute $2^{L}$ terms of the sum.

More generally, if A is "near" the invertible matrix X in the sense that

$\lim _{n\to \infty }\left(\mathbf {I} -\mathbf {X} ^{-1}\mathbf {A} \right)^{n}=0\mathrm {~~or~~} \lim _{n\to \infty }\left(\mathbf {I} -\mathbf {A} \mathbf {X} ^{-1}\right)^{n}=0$

then A is nonsingular and its inverse is

$\mathbf {A} ^{-1}=\sum _{n=0}^{\infty }\left(\mathbf {X} ^{-1}(\mathbf {X} -\mathbf {A} )\right)^{n}\mathbf {X} ^{-1}~.$

If it is also the case that A − X has rank 1 then this simplifies to

$\mathbf {A} ^{-1}=\mathbf {X} ^{-1}-{\frac {\mathbf {X} ^{-1}(\mathbf {A} -\mathbf {X} )\mathbf {X} ^{-1}}{1+\operatorname {tr} \left(\mathbf {X} ^{-1}(\mathbf {A} -\mathbf {X} )\right)}}~.$

p-adic approximation

If A is a matrix with integer or rational coefficients and we seek a solution in arbitrary-precision rationals, then a p-adic approximation method converges to an exact solution in $O\left(n^{4}\log ^{2}n\right)$, assuming standard $O\left(n^{3}\right)$ matrix multiplication is used. The method relies on solving n linear systems via Dixon's method of p-adic approximation (each in $O(n^{3}\log ^{2}n)$) and is available as such in software specialized in arbitrary-precision matrix operations, for example, in IML.

Reciprocal basis vectors method

Given an $n\times n$ square matrix $\mathbf {X} =\left[x^{ij}\right]$, $1\leq i,j\leq n$, with $n$ rows interpreted as $n$ vectors $\mathbf {x} _{i}=x^{ij}\mathbf {e} _{j}$ (Einstein summation assumed) where the $\mathbf {e} _{j}$ are a standard orthonormal basis of Euclidean space $\mathbb {R} ^{n}$ ($\mathbf {e} _{i}=\mathbf {e} ^{i},\mathbf {e} _{i}\cdot \mathbf {e} ^{j}=\delta _{i}^{j}$), then using Clifford algebra (or Geometric Algebra) we compute the reciprocal (sometimes called dual) column vectors $\mathbf {x} ^{i}=x_{ji}\mathbf {e} ^{j}=(-1)^{i-1}(\mathbf {x} _{1}\wedge \cdots \wedge ()_{i}\wedge \cdots \wedge \mathbf {x} _{n})\cdot (\mathbf {x} _{1}\wedge \ \mathbf {x} _{2}\wedge \cdots \wedge \mathbf {x} _{n})^{-1}$ as the columns of the inverse matrix $\mathbf {X} ^{-1}=[x_{ji}]$. Note that, the place "$()_{i}$" indicates that "$\mathbf {x} _{i}$" is removed from that place in the above expression for $\mathbf {x} ^{i}$. We then have $\mathbf {X} \mathbf {X} ^{-1}=\left[\mathbf {x} _{i}\cdot \mathbf {x} ^{j}\right]=\left[\delta _{i}^{j}\right]=\mathbf {I} _{n}$, where $\delta _{i}^{j}$ is the Kronecker delta. We also have $\mathbf {X} ^{-1}\mathbf {X} =\left[\left(\mathbf {e} _{i}\cdot \mathbf {x} ^{k}\right)\left(\mathbf {e} ^{j}\cdot \mathbf {x} _{k}\right)\right]=\left[\mathbf {e} _{i}\cdot \mathbf {e} ^{j}\right]=\left[\delta _{i}^{j}\right]=\mathbf {I} _{n}$, as required. If the vectors $\mathbf {x} _{i}$ are not linearly independent, then $(\mathbf {x} _{1}\wedge \mathbf {x} _{2}\wedge \cdots \wedge \mathbf {x} _{n})=0$ and the matrix $\mathbf {X}$ is not invertible (has no inverse).

Derivative of the matrix inverse

Suppose that the invertible matrix A depends on a parameter t. Then the derivative of the inverse of A with respect to t is given by

${\frac {\mathrm {d} \mathbf {A} ^{-1}}{\mathrm {d} t}}=-\mathbf {A} ^{-1}{\frac {\mathrm {d} \mathbf {A} }{\mathrm {d} t}}\mathbf {A} ^{-1}.$

To derive the above expression for the derivative of the inverse of A, one can differentiate the definition of the matrix inverse $\mathbf {A} ^{-1}\mathbf {A} =\mathbf {I}$ and then solve for the inverse of A:

${\frac {\mathrm {d} (\mathbf {A} ^{-1}\mathbf {A} )}{\mathrm {d} t}}={\frac {\mathrm {d} \mathbf {A} ^{-1}}{\mathrm {d} t}}\mathbf {A} +\mathbf {A} ^{-1}{\frac {\mathrm {d} \mathbf {A} }{\mathrm {d} t}}={\frac {\mathrm {d} \mathbf {I} }{\mathrm {d} t}}=\mathbf {0} .$

Subtracting $\mathbf {A} ^{-1}{\frac {\mathrm {d} \mathbf {A} }{\mathrm {d} t}}$ from both sides of the above and multiplying on the right by $\mathbf {A} ^{-1}$ gives the correct expression for the derivative of the inverse:

${\frac {\mathrm {d} \mathbf {A} ^{-1}}{\mathrm {d} t}}=-\mathbf {A} ^{-1}{\frac {\mathrm {d} \mathbf {A} }{\mathrm {d} t}}\mathbf {A} ^{-1}.$

Similarly, if $\varepsilon$ is a small number then

$\left(\mathbf {A} +\varepsilon \mathbf {X} \right)^{-1}=\mathbf {A} ^{-1}-\varepsilon \mathbf {A} ^{-1}\mathbf {X} \mathbf {A} ^{-1}+{\mathcal {O}}(\varepsilon ^{2})\,.$

More generally, if

${\frac {\mathrm {d} f(\mathbf {A} )}{\mathrm {d} t}}=\sum _{i}g_{i}(\mathbf {A} ){\frac {\mathrm {d} \mathbf {A} }{\mathrm {d} t}}h_{i}(\mathbf {A} ),$

then,

$f(\mathbf {A} +\varepsilon \mathbf {X} )=f(\mathbf {A} )+\varepsilon \sum _{i}g_{i}(\mathbf {A} )\mathbf {X} h_{i}(\mathbf {A} )+{\mathcal {O}}\left(\varepsilon ^{2}\right).$

Given a positive integer $n$,

${\begin{aligned}{\frac {\mathrm {d} \mathbf {A} ^{n}}{\mathrm {d} t}}&=\sum _{i=1}^{n}\mathbf {A} ^{i-1}{\frac {\mathrm {d} \mathbf {A} }{\mathrm {d} t}}\mathbf {A} ^{n-i},\\{\frac {\mathrm {d} \mathbf {A} ^{-n}}{\mathrm {d} t}}&=-\sum _{i=1}^{n}\mathbf {A} ^{-i}{\frac {\mathrm {d} \mathbf {A} }{\mathrm {d} t}}\mathbf {A} ^{-(n+1-i)}.\end{aligned}}$

Therefore,

${\begin{aligned}(\mathbf {A} +\varepsilon \mathbf {X} )^{n}&=\mathbf {A} ^{n}+\varepsilon \sum _{i=1}^{n}\mathbf {A} ^{i-1}\mathbf {X} \mathbf {A} ^{n-i}+{\mathcal {O}}\left(\varepsilon ^{2}\right),\\(\mathbf {A} +\varepsilon \mathbf {X} )^{-n}&=\mathbf {A} ^{-n}-\varepsilon \sum _{i=1}^{n}\mathbf {A} ^{-i}\mathbf {X} \mathbf {A} ^{-(n+1-i)}+{\mathcal {O}}\left(\varepsilon ^{2}\right).\end{aligned}}$

Generalized inverse

Some of the properties of inverse matrices are shared by generalized inverses (for example, the Moore–Penrose inverse), which can be defined for any m-by-n matrix.

Applications

For most practical applications, it is not necessary to invert a matrix to solve a system of linear equations; however, for a unique solution, it is necessary that the matrix involved be invertible.

Decomposition techniques like LU decomposition are much faster than inversion, and various fast algorithms for special classes of linear systems have also been developed.

Regression/least squares

Although an explicit inverse is not necessary to estimate the vector of unknowns, it is the easiest way to estimate their accuracy, found in the diagonal of a matrix inverse (the posterior covariance matrix of the vector of unknowns). However, faster algorithms to compute only the diagonal entries of a matrix inverse are known in many cases.

Matrix inverses in real-time simulations

Matrix inversion plays a significant role in computer graphics, particularly in 3D graphics rendering and 3D simulations. Examples include screen-to-world ray casting, world-to-subspace-to-world object transformations, and physical simulations.

Matrix inverses in MIMO wireless communication

Matrix inversion also plays a significant role in the MIMO (Multiple-Input, Multiple-Output) technology in wireless communications. The MIMO system consists of N transmit and M receive antennas. Unique signals, occupying the same frequency band, are sent via N transmit antennas and are received via M receive antennas. The signal arriving at each receive antenna will be a linear combination of the N transmitted signals forming an N × M transmission matrix H. It is crucial for the matrix H to be invertible for the receiver to be able to figure out the transmitted information.

Resources

• Inverse Matrices and Their Properties, video by Professor Dave Explains
• Introduction to Matrix Inverses, Khan Academy

References

1. "Comprehensive List of Algebra Symbols". Math Vault. 2020-03-25. Retrieved 2020-09-08.
2. "Invertible Matrices". www.sosmath.com. Retrieved 2020-09-08.
3. Weisstein, Eric W. "Matrix Inverse". mathworld.wolfram.com. Retrieved 2020-09-08.
4. Weisstein, Eric W. "Invertible Matrix Theorem". mathworld.wolfram.com. Retrieved 2020-09-08.
5. Horn, Roger A.; Johnson, Charles R. (1985). Matrix Analysis. Cambridge University Press. p. 14. ISBN 978-0-521-38632-6..
6. Pan, Victor; Reif, John (1985), Efficient Parallel Solution of Linear Systems, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence: ACM
7. Pan, Victor; Reif, John (1985), Harvard University Center for Research in Computing Technology Report TR-02-85, Cambridge, MA: Aiken Computation Laboratory
8. "The Inversion of Large Matrices". Byte Magazine. 11 (4): 181–190. April 1986.
9. A proof can be found in the Appendix B of Kondratyuk, L. A.; Krivoruchenko, M. I. (1992). "Superconducting quark matter in SU(2) color group". Zeitschrift für Physik A. 344: 99–115. doi:10.1007/BF01291027. S2CID 120467300.
10. Strang, Gilbert (2003). Introduction to linear algebra (3rd ed.). SIAM. p. 71. ISBN 978-0-9614088-9-3., Chapter 2, page 71
11. Bernstein, Dennis (2005). Matrix Mathematics. Princeton University Press. p. 44. ISBN 978-0-691-11802-4.
12. Bernstein, Dennis (2005). Matrix Mathematics. Princeton University Press. p. 45. ISBN 978-0-691-11802-4.
13. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, 3rd ed., MIT Press, Cambridge, MA, 2009, §28.2.
14. Ran Raz. On the complexity of matrix product. In Proceedings of the thirty-fourth annual ACM symposium on Theory of computing. ACM Press, 2002. doi:10.1145/509907.509932.
15. Stewart, Gilbert (1998). Matrix Algorithms: Basic decompositions. SIAM. p. 55. ISBN 978-0-89871-414-2.
16. Haramoto, H.; Matsumoto, M. (2009). "A p-adic algorithm for computing the inverse of integer matrices". Journal of Computational and Applied Mathematics. 225: 320–322. doi:10.1016/j.cam.2008.07.044.
17. "IML - Integer Matrix Library". cs.uwaterloo.ca. Retrieved 14 April 2018.
18. Magnus, Jan R.; Neudecker, Heinz (1999). Matrix Differential Calculus : with Applications in Statistics and Econometrics (Revised ed.). New York: John Wiley & Sons. pp. 151–152. ISBN 0-471-98633-X.
19. Lin, Lin; Lu, Jianfeng; Ying, Lexing; Car, Roberto; E, Weinan (2009). "Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems". Communications in Mathematical Sciences. 7 (3): 755–777. doi:10.4310/CMS.2009.v7.n3.a12.