The re-analysis of linear structure on serial and parallel computers

This paper discusses the problem of re-computing the solution of a large sparse and banded system of linear equations when a change of low rank is made to the coefficient matrix, using examples taken from the field of structural design. It describes a number of algorithms and gives operation counts and times for their implementation on a serial computer. The paper concludes with a discussion of ways in which the algorithms can be implemented on two types of parallel computer. (Author)