Significantly, Algorithm  does not record any of the modified rows of \(D\)  in memory; rather it recomputes each modified pivot row as the product of a corresponding row of \(\overline{ {R} }\)  with \(D\) , whenever needed. This is essentially the strategy pioneered by [1]}; as discussed in that work, it can cut memory use dramatically.
