Direct methods for sparse matrices (with I.S. Duff and A.M. Erisman). Oxford University Press, 1986. Reprinted in paperback, 1989.
The F programming language (with Michael Metcalf). Oxford University Press, 1996.
Fortran 95/2003 Explained (with M. Metcalf and M. Cohen). Oxford University Press, 2004.
Large sparse sets of linear equations, Academic Press, 1971.
The relationship between numerical computation and programming languages, North Holland, 1982.
Vector and parallel processors in computational science (with I.S. Duff), Computer Physics Communications, 37, 1985.
On applying Householder transformations to linear least squares problems (with M.J.D. Powell). Described fully as Harwell Report TP 322. In condensed form in "Information processing 68", ed. A.J.H. Morrell, North Holland, 1969.
On the method of conjugate gradients for the solution of large sparse systems of linear equations. In "Large sparse sets of linear equations", ed. J.K. Reid, Academic Press, 1971.
A note on the stability of Gaussian elimination. J. Inst. Maths. Applics., 8, 374-375, 1971.
The use of conjugate gradients for systems of linear equations possessing 'property A'. SIAM J. Numer. Anal. 9, 325-332, 1972.
On the automatic scaling of matrices for Gaussian elimination (with A.R. Curtis). J. Inst. Maths. Applics. 10, 118-124, 1972.
On the estimation of sparse Jacobian matrices (with A.R. Curtis and M.J.D. Powell). J. Inst. Maths. Applics. 13, 117-120, 1974.
A practical steepest-edge simplex algorithm (with D. Goldfarb). Mathematical Programming 12 (1977), 361-371.
A sparsity exploiting variant of the Bartels-Golub decomposition for linear programming bases. Mathematical programming 24 (1982), 55-69.
An implementation of Tarjan's algorithm for the block triangularization of a matrix (with I.S. Duff). ACM Trans. Math. Software 4 (1978), 137-147 and 189-192.
Some design features of a sparse matrix code (with I.S. Duff). ACM Trans. Math. Software 5 (1979), 18-35.
Tracking the progress of Lanczos' algorithm for the very large symmetric eigenproblem (with B.N. Partlett). IMA J. Num. Anal. (1981), 135-155.
The multifrontal solution of indefinite sparse symmetric linear systems (with I.S. Duff). ACM Trans. Math. Software 9 (1983), 302-325.
The design of MA48, a code for the direct solution of sparse unsymmetric linear systems of equations (with I.S. Duff). ACM Trans. Math. Software (1996), 187-226.
Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems (with I.S. Duff). Report RAL-95-040. ACM Trans. Math. Software (1996), 227-257.
Ordering symmetric sparse matrices for small profile and wavefront (with J. A. Scott). RAL-TR-98-016 (PDF), Feb., 1998. Int. J. Numer. Meth. Engrg., 45 (1999), 1737-1755.
Implicit weighting for linear least squares problems. RAL-TR-98-027 (PDF), Mar., 1998. BIT (2000), 40, 146-157.
Co-Array Fortran for parallel programming (with R. W. Numrich). RAL-TR-1998-060 (PDF), August 1998. ACM Fortran Forum (1998), 17, 2, 1-31.
Reversing the row order for the row-by-row frontal method (with J. A. Scott). RAL-TR-1999-037 (PDF), May 1999. Numerical Linear Algebra with Applications (2001), 8, 1-6.
Implementing Hager's exchange methods for matrix profile reduction (with J. A. Scott). RAL-TR-2001-039 (PDF), November 2001. ACM Trans. Math. Software (2002), 28, 377-391.
128. Jacobian Code Generated by Source Transformation and Vertex Elimination is as Efficient as Hand Coding (with S. A. Forth, M. Tadjouddine, and J. D. Pryce). RAL-TR-2002-029 (PDF), December 2002. ACM Trans. Math. Software (2004), 30, 266-299.
A Fully Portable High Performance Minimal Storage Hybrid Format Cholesky Algorithm (with B. S. Andersen, J. A. Gunnels, Fred G. Gustavson, and J. Wasniewski). RAL-TR-2004-017 (PDF), May 2004. ACM Trans. Math. Software, 31 (2005), 201-227.
Reducing the total bandwidth of a sparse unsymmetric matrix. (with J. A. Scott). RAL-TR-2005-001 PDF), January 2005. SIAM J. Matrix Analysis and Appplications, 28, 3 (2006) 805-821.
Co-arrays in the next Fortran Standard (with R. W. Numrich). RAL-TR-2007-001. Fortran Forum (2005), 24, 2, 4-17.
An out-of-core sparse Cholesky solver (with J. A. Scott). RAL-TR-2006-013 PDF), October 2006. To appear in ACM Trans. Math. Software.
HSL_OF01, a virtual memory system in Fortran (with J. A. Scott). RAL-TR-2006-026 PDF) October 2006. To appear in ACM Trans. Math. Software.
An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems (with J. A. Scott). RAL-TR-2007-014 (PDF), December 2007. To appear in Int. J. Numer. Meth. Engng.
An efficient out-of-core sparse symmetric indefinite direct solver (with J. A. Scott). RAL-TR-2008-024 (PDF), October 2008.