We describe an implementation of QR up- and downdating on a massively
parallel computer (the Connection Machine CM-200) and show that the al
gorithm maps well onto the computer. In particular, we show how the us
e of corrected semi-normal equations for downdating can be efficiently
implemented. We also illustrate the use of our algorithms in a new LP
algorithm.