In linear algebra and statistics, the partial inverse of a matrix is an operation related to Gaussian elimination which has applications in numerical analysis and statistics. It is also known by various authors as the principal pivot transform, or as the sweep, gyration, or exchange operator.

Given an ${\displaystyle n\times n}$ matrix ${\displaystyle A}$ over a vector space ${\displaystyle V}$ partitioned into blocks:

${\displaystyle A={\begin{pmatrix}A_{11}&A_{12}\\A_{21}&A_{22}\end{pmatrix))}$

If ${\displaystyle A_{11))$ is invertible, then the partial inverse of ${\displaystyle A}$ around the pivot block ${\displaystyle A_{11))$ is created by inverting ${\displaystyle A_{11))$, putting the Schur complement ${\displaystyle A/A_{11))$ in place of ${\displaystyle A_{22))$, and adjusting the off-diagonal elements accordingly:^[1]

${\displaystyle \operatorname {inv} _{1}A={\begin{pmatrix}(A_{11})^{-1}&-(A_{11})^{-1}A_{12}\\A_{21}(A_{11})^{-1}&A_{22}-A_{21}(A_{11})^{-1}A_{12}\end{pmatrix))}$

Conceptually, partial inversion corresponds to a rotation^[2] of the graph of the matrix ${\displaystyle (X,AX)\in V\times V}$, such that, for conformally-partitioned column matrices ${\displaystyle (x_{1},x_{2})^{T))$ and ${\displaystyle (y_{1},y_{2})^{T))$:^[1]

${\displaystyle A{\begin{pmatrix}x_{1}\\x_{2}\end{pmatrix))={\begin{pmatrix}y_{1}\\y_{2}\end{pmatrix))\Leftrightarrow \operatorname {inv} _{1}(A){\begin{pmatrix}y_{1}\\x_{2}\end{pmatrix))={\begin{pmatrix}x_{1}\\y_{2}\end{pmatrix))}$

As defined this way, this operator is its own inverse: ${\displaystyle \operatorname {inv} _{k}(\operatorname {inv} _{k}(A))=A}$, and if the pivot block ${\displaystyle A_{11))$ is chosen to be the entire matrix, then the transform simply gives the matrix inverse ${\displaystyle A^{-1))$. Note that some authors define a related operation (under one of the other names) which is not an inverse per se; particularly, one common definition instead has ${\displaystyle (\operatorname {inv} _{k})^{2}(A)=-A}$.

The transform is often presented as a pivot around a single non-zero element ${\displaystyle a_{kk))$, in which case one has

${\displaystyle \left[\operatorname {inv} _{k}(A)\right]_{ij}={\begin{cases}{\frac {1}{a_{kk))}&i=j=k\\-{\frac {a_{kj)){a_{kk))}&i=k,j\neq k\\{\frac {a_{ik)){a_{kk))}&i\neq k,j=k\\a_{ij}-{\frac {a_{ik}a_{kj)){a_{kk))}&i\neq k,j\neq k\end{cases))}$

Partial inverses obey a number of nice properties:^[3]

• inversions around different blocks commute, so larger pivots may be built up from sequences of smaller ones
• partial inversion preserves the space of symmetric matrices

Use of the partial inverse in numerical analysis is due to the fact that there is some flexibility in the choices of pivots, allowing for non-invertible elements to be avoided, and because the operation of rotation (of the graph of the pivoted matrix) has better numerical stability than the shearing operation which is implicitly performed by Gaussian elimination.^[2] Use in statistics is due to the fact that the resulting matrix nicely decomposes into blocks which have useful meanings in the context of linear regression.^[3]