We describe in moderate detail an algorithm for the solution of a general sparse set of linear equations. It aims to maintain both stability and sparseness, and allows further systems with the same matrix, or another matrix having the same sparsity pattern, to be solved economically. It is compared, in tests on several non-trivial problems, with two earlier algorithms from which it was derived, and appears to combine the best features of both.