In linear algebra, the Sherman–Morrison formula, named after Jack Sherman and Winifred J. Morrison, computes the inverse of a "rank-1 update" to a matrix whose inverse has previously been computed. That is, given an invertible matrix A and the outer product of vectors u and v, the formula cheaply computes an updated matrix inverse The Sherman–Morrison formula is a special case of the Woodbury formula. Though named after Sherman and Morrison, it appeared already in earlier publications.

Statement

Suppose is an invertible square matrix and are column vectors. Then is invertible if and only if. In this case, Here, is the outer product of two vectors u and v. The general form shown here is the one published by Bartlett.

Proof

(\Leftarrow) To prove that the backward direction is invertible with inverse given as above) is true, we verify the properties of the inverse. A matrix Y (in this case the right-hand side of the Sherman–Morrison formula) is the inverse of a matrix X (in this case ) if and only if XY = YX = I. We first verify that the right hand side (Y) satisfies XY = I. To end the proof of this direction, we need to show that YX = I in a similar way as above: (In fact, the last step can be avoided since for square matrices X and Y, XY = I is equivalent to YX = I.) (\Rightarrow) Reciprocally, if, then via the matrix determinant lemma, , so is not invertible.

Application

If the inverse of A is already known, the formula provides a numerically cheap way to compute the inverse of A corrected by the matrix (depending on the point of view, the correction may be seen as a perturbation or as a rank-1 update). The computation is relatively cheap because the inverse of does not have to be computed from scratch (which in general is expensive), but can be computed by correcting (or perturbing) A^{-1}. Using unit columns (columns from the identity matrix) for u or v, individual columns or rows of A may be manipulated and a correspondingly updated inverse computed relatively cheaply in this way. In the general case, where A^{-1} is an n-by-n matrix and u and v are arbitrary vectors of dimension n, the whole matrix is updated and the computation takes 3n^2 scalar multiplications. If u is a unit column, the computation takes only 2n^2 scalar multiplications. The same goes if v is a unit column. If both u and v are unit columns, the computation takes only n^2 scalar multiplications. This formula also has application in theoretical physics. Namely, in quantum field theory, one uses this formula to calculate the propagator of a spin-1 field. The inverse propagator (as it appears in the Lagrangian) has the form. One uses the Sherman–Morrison formula to calculate the inverse (satisfying certain time-ordering boundary conditions) of the inverse propagator—or simply the (Feynman) propagator—which is needed to perform any perturbative calculation involving the spin-1 field. One of the issues with the formula is that little is known about its numerical stability. There are no published results concerning its error bounds. Anecdotal evidence suggests that the Woodbury matrix identity (a generalization of the Sherman–Morrison formula) may diverge even for seemingly benign examples (when both the original and modified matrices are well-conditioned).

Alternative verification

Following is an alternate verification of the Sherman–Morrison formula using the easily verifiable identity Let then Substituting w = A^{-1}u gives

Generalization (Woodbury matrix identity)

Given a square invertible n \times n matrix A, an n \times k matrix U, and a k \times n matrix V, let B be an n \times n matrix such that B = A + UV. Then, assuming is invertible, we have