# Woodbury matrix identity

In mathematics (specifically linear algebra), the Woodbury matrix identity, named after Max A. Woodbury[1][2] says that the inverse of a rank-k correction of some matrix can be computed by doing a rank-k correction to the inverse of the original matrix. Alternative names for this formula are the matrix inversion lemma, Sherman–Morrison–Woodbury formula or just Woodbury formula. However, the identity appeared in several papers before the Woodbury report.[3]

The Woodbury matrix identity is[4]

${\displaystyle \left(A+UCV\right)^{-1}=A^{-1}-A^{-1}U\left(C^{-1}+VA^{-1}U\right)^{-1}VA^{-1},}$

where A, U, C and V all denote matrices of the correct (conformable) sizes. Specifically, A is n-by-n, U is n-by-k, C is k-by-k and V is k-by-n. This can be derived using blockwise matrix inversion.

For a more general formula for which the matrix C need not be invertible or even square, see Binomial inverse theorem.

In the special case where C is the 1-by-1 unit matrix, this identity reduces to the Sherman–Morrison formula. In the special case when C is the identity matrix I, the matrix ${\displaystyle I+VA^{-1}U}$ is known in numerical linear algebra and numerical partial differential equations as the capacitance matrix.[3]

## Direct proof

The formula can be proven by checking that ${\displaystyle (A+UCV)}$ times its alleged inverse on the right side of the Woodbury identity gives the identity matrix:

{\displaystyle {\begin{aligned}&\left(A+UCV\right)\left[A^{-1}-A^{-1}U\left(C^{-1}+VA^{-1}U\right)^{-1}VA^{-1}\right]\\&\quad =I+UCVA^{-1}-(U+UCVA^{-1}U)(C^{-1}+VA^{-1}U)^{-1}VA^{-1}\\&\quad =I+UCVA^{-1}-UC(C^{-1}+VA^{-1}U)(C^{-1}+VA^{-1}U)^{-1}VA^{-1}\\&\quad =I+UCVA^{-1}-UCVA^{-1}=I.\end{aligned}}}

## Derivation via blockwise elimination

Deriving the Woodbury matrix identity is easily done by solving the following block matrix inversion problem

${\displaystyle {\begin{bmatrix}A&U\\V&-C^{-1}\end{bmatrix}}{\begin{bmatrix}X\\Y\end{bmatrix}}={\begin{bmatrix}I\\0\end{bmatrix}}.}$

Expanding, we can see that the above reduces to ${\displaystyle AX+UY=I}$ and ${\displaystyle VX-C^{-1}Y=0}$, which is equivalent to ${\displaystyle (A+UCV)X=I}$. Eliminating the first equation, we find that ${\displaystyle X=A^{-1}(I-UY)}$, which can be substituted into the second to find ${\displaystyle VA^{-1}(I-UY)=C^{-1}Y}$. Expanding and rearranging, we have ${\displaystyle VA^{-1}=(C^{-1}+VA^{-1}U)Y}$, or ${\displaystyle (C^{-1}+VA^{-1}U)^{-1}VA^{-1}=Y}$. Finally, we substitute into our ${\displaystyle AX+UY=I}$, and we have ${\displaystyle AX+U(C^{-1}+VA^{-1}U)^{-1}VA^{-1}=I}$. Thus,

${\displaystyle (A+UCV)^{-1}=X=A^{-1}-A^{-1}U\left(C^{-1}+VA^{-1}U\right)^{-1}VA^{-1}.}$

We have derived the Woodbury matrix identity.

## Derivation from LDU decomposition

We start by the matrix

${\displaystyle {\begin{bmatrix}A&U\\V&C\end{bmatrix}}}$

By eliminating the entry under the A (given that A is invertible) we get

${\displaystyle {\begin{bmatrix}I&0\\-VA^{-1}&I\end{bmatrix}}{\begin{bmatrix}A&U\\V&C\end{bmatrix}}={\begin{bmatrix}A&U\\0&C-VA^{-1}U\end{bmatrix}}}$

Likewise, eliminating the entry above C gives

${\displaystyle {\begin{bmatrix}A&U\\V&C\end{bmatrix}}{\begin{bmatrix}I&-A^{-1}U\\0&I\end{bmatrix}}={\begin{bmatrix}A&0\\V&C-VA^{-1}U\end{bmatrix}}}$

Now combining the above two, we get

${\displaystyle {\begin{bmatrix}I&0\\-VA^{-1}&I\end{bmatrix}}{\begin{bmatrix}A&U\\V&C\end{bmatrix}}{\begin{bmatrix}I&-A^{-1}U\\0&I\end{bmatrix}}={\begin{bmatrix}A&0\\0&C-VA^{-1}U\end{bmatrix}}}$

Moving to the right side gives

${\displaystyle {\begin{bmatrix}A&U\\V&C\end{bmatrix}}={\begin{bmatrix}I&0\\VA^{-1}&I\end{bmatrix}}{\begin{bmatrix}A&0\\0&C-VA^{-1}U\end{bmatrix}}{\begin{bmatrix}I&A^{-1}U\\0&I\end{bmatrix}}}$

which is the LDU decomposition of the block matrix into an upper triangular, diagonal, and lower triangular matrices.

Now inverting both sides gives

{\displaystyle {\begin{aligned}{\begin{bmatrix}A&U\\V&C\end{bmatrix}}^{-1}&={\begin{bmatrix}I&A^{-1}U\\0&I\end{bmatrix}}^{-1}{\begin{bmatrix}A&0\\0&C-VA^{-1}U\end{bmatrix}}^{-1}{\begin{bmatrix}I&0\\VA^{-1}&I\end{bmatrix}}^{-1}\\[8pt]&={\begin{bmatrix}I&-A^{-1}U\\0&I\end{bmatrix}}{\begin{bmatrix}A^{-1}&0\\0&(C-VA^{-1}U)^{-1}\end{bmatrix}}{\begin{bmatrix}I&0\\-VA^{-1}&I\end{bmatrix}}\\[8pt]&={\begin{bmatrix}A^{-1}+A^{-1}U(C-VA^{-1}U)^{-1}VA^{-1}&-A^{-1}U(C-VA^{-1}U)^{-1}\\-(C-VA^{-1}U)^{-1}VA^{-1}&(C-VA^{-1}U)^{-1}\end{bmatrix}}\qquad \mathrm {(1)} \end{aligned}}}

We could equally well have done it the other way (provided that C is invertible) i.e.

${\displaystyle {\begin{bmatrix}A&U\\V&C\end{bmatrix}}={\begin{bmatrix}I&UC^{-1}\\0&I\end{bmatrix}}{\begin{bmatrix}A-UC^{-1}V&0\\0&C\end{bmatrix}}{\begin{bmatrix}I&0\\C^{-1}V&I\end{bmatrix}}}$

Now again inverting both sides,

{\displaystyle {\begin{aligned}{\begin{bmatrix}A&U\\V&C\end{bmatrix}}^{-1}&={\begin{bmatrix}I&0\\C^{-1}V&I\end{bmatrix}}^{-1}{\begin{bmatrix}A-UC^{-1}V&0\\0&C\end{bmatrix}}^{-1}{\begin{bmatrix}I&UC^{-1}\\0&I\end{bmatrix}}^{-1}\\[8pt]&={\begin{bmatrix}I&0\\-C^{-1}V&I\end{bmatrix}}{\begin{bmatrix}(A-UC^{-1}V)^{-1}&0\\0&C^{-1}\end{bmatrix}}{\begin{bmatrix}I&-UC^{-1}\\0&I\end{bmatrix}}\\[8pt]&={\begin{bmatrix}(A-UC^{-1}V)^{-1}&-(A-UC^{-1}V)^{-1}UC^{-1}\\-C^{-1}V(A-UC^{-1}V)^{-1}&C^{-1}V(A-UC^{-1}V)^{-1}UC^{-1}+C^{-1}\end{bmatrix}}\qquad \mathrm {(2)} \end{aligned}}}

Now comparing elements (1,1) of the RHS of (1) and (2) above gives the Woodbury formula

${\displaystyle \left(A-UC^{-1}V\right)^{-1}=A^{-1}+A^{-1}U(C-VA^{-1}U)^{-1}VA^{-1}.}$

## Applications

This identity is useful in certain numerical computations where A−1 has already been computed and it is desired to compute (A + UCV)−1. With the inverse of A available, it is only necessary to find the inverse of C + VA−1U in order to obtain the result using the right-hand side of the identity. If C has a much smaller dimension than A, this is more efficient than inverting A + UCV directly. A common case is finding the inverse of a low-rank update A + UCV of A (where U only has a few columns and V only a few rows), or finding an approximation of the inverse of the matrix A + B where the matrix B can be approximated by a low-rank matrix UCV, for example using the singular value decomposition.

This is applied, e.g., in the Kalman filter and recursive least squares methods, to replace the parametric solution, requiring inversion of a state vector sized matrix, with a condition equations based solution. In case of the Kalman filter this matrix has the dimensions of the vector of observations, i.e., as small as 1 in case only one new observation is processed at a time. This significantly speeds up the often real time calculations of the filter.