Skip to Main Content
Simple recursive methods for inverting an n ?? n matrix A + E in terms of A-1 and E are presented, where E represents a matrix of modifications of the matrix A. Algorithms for rank one and rank r matrix modifications are given. In addition, simple methods for determining if A + E is invertible are developed. Applications of these methods to pattern recognition problems where the inversion of a matrix (e.g. covariance matrix, scatter matrix, etc.) must be computed and frequently updated as changes in data occur are illustrated.