A Comparison of Some Methods for the Solution of Sparse Overdetermined Systems of Linear Equations

Abstract

Four methods for the least squares solution of overdetermined systems of linear equations are compared from the point of view of preservation of sparsity. Conclusions are drawn principally from the results of numerical experiments, and favour the methods of Peters & Wilkinson (1970) and an augmented matrix approach suggested by Hachtel (private communication).