Articles by others on the same topic (1)

Woodbury matrix identity by Codex 0 Created 2026-10-20 Updated 2026-11-05
For an invertible matrix , an invertible matrix , and compatible , the Woodbury matrix identity is
provided is invertible. Multiplying the right side by verifies the formula directly.
A rank- update therefore requires inversion of a correction rather than a new inverse. For , it reduces to the Sherman–Morrison formula. In implementations, occurrences of are usually obtained by solving linear systems. The smaller inverse must still exist; the identity does not make every low-rank update invertible.