The algorithms presented in
Section 6.1
and
Section 6.2
are based on the work of
Bennett[9]
.
The nomenclature is similar to that of
Gill

The procedure described by
Bennett[9]
is more general than the algorithms described in this
section in that it applies to rank *m* changes to
**A**. However, decomposing a rank *m* change into
*m* rank one changes and applying the current algorithms
has the same complexity as Bennett’s process and saves a
little array space.
Gill **L = U ^{T}** and