Abstract/Summary

Null-space methods have long been used to solve large sparse n x n symmetric saddle point systems of equations in which the (2,2) block is zero. This paper focuses on the case where the (1,1) block is ill conditioned or rank deficient and the k x k (2,2) block is non zero and small (k << n). Additionally, the (2,1) block may be rank deficient. Such systems arise in a range of practical applications. A novel null-space approach is proposed that transforms the system matrix into a nicer symmetric saddle point matrix of order n that has a non zero (2,2) block of order at most 2k and, importantly, the(1,1)$ block is symmetric positive definite. Success of any null-space approach depends on constructing a suitable null-space basis. We propose methods for wide matrices having far fewer rows than columns with the aim of balancing stability of the transformed saddle point matrix with preserving sparsity in the (1,1) block. Linear least squares problems that contain a small number of dense rows are an important motivation and are used to illustrate our ideas and to explore their potential for solving large-scale systems.