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.
1. An elliptic eigenvalue problem for a re-entrant region. J. SIAM Appl. Maths. 13, 1965 (with J.E. Walsh).
2. A method for finding the optimum successive over-relaxation parameter. Comp. J. 9, 1966.
3. A note on the least squares solution of a band system of linear equations by Householder reductions. Comp. J. 10, 1967.
4. 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.
5. On the solution of a system of linear equations whose matrix is symmetric but not definite (with B.N. Parlett). BIT 10, 1970.
6. A numerical method for locating the zeros and poles of a meromorphic function (with L.F. Abd-Elall and L.M. Delves). In "Numerical methods for non-linear algebraic equations", ed. P. Rabinowitz, Gordon and Breach, 1970.
7. 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. Also Harwell Report TP 411.
8. A Fortran subroutine for the solution of large sparse sets of linear equations by conjugate gradients. Harwell Report R 6545, September 1970.
9. A note on the approximation of plane regions. Harwell Report TP 420, September 1970. Comp. J. 14, 307-308, 1971.
10. Fortran subroutines for the solution of Laplace's equation over a general region in two dimensions (with A.B. Turner). Harwell Report TP 422, September 1970.
11. On the construction and convergence of a finite-element solution of Laplace's equation. Harwell Report TP 436, December 1970. Shortened version in J. Inst. Maths. Applics., 9, 1-13, 1972.
12. The solution of large sparse unsymmetric systems of linear equations (with A.R. Curtis). Information processing 71, ed. C.V. Freiman, North Holland, 1972.
13. A note on the stability of Gaussian elimination. Harwell Report TP 441, February 1971. J. Inst. Maths. Applics., 8, 374-375, 1971.
14. The use of conjugate gradients for systems of linear equations possessing 'property A'. Harwell Report TP 445, March 1971. SIAM J. Numer. Anal. 9, 325-332, 1972.
15. On the automatic scaling of matrices for Gaussian elimination (with A.R. Curtis). Harwell Report TP 444. J. Inst. Maths. Applics. 10, 118-124, 1972.
16. The solution of large sparse unsymmetric systems of linear equations (with A.R. Curtis). Harwell Report TP 450, June 1971. J. Inst. Maths. Applics. 8, 344-353, 1971.
17. Fortran subroutines for the solution of sparse sets of linear equations (with A.R. Curtis). Harwell Report R 6844, June 1971.
18. Fortran subroutines for the solution of linear equations, inversion of matrices and evaluation of determinants (with S. Marlow). Harwell Report R 6899, September 1971.
19. On the estimation of sparse Jacobian matrices (with A.R. Curtis and M.J.D. Powell). Harwell Report TP 476, February 1972. J. Inst. Maths. Applics. 13, 117-120, 1974.
20. The choice of step lengths when using differences to approximate Jacobian matrices (with A.R. Curtis). Harwell Report TP 477, February 1972. J. Inst. Maths. Applics. 13, 121-126, 1974.
21. On the convergence rates of variational methods II. Systems of type B,C (with T.L. Freeman and L.M. Delves). University of Liverpool Report, April 1972. J. Inst. Maths. Applics. 14, 145-157, 1974.
22. Two Fortran subroutines for direct solution of linear equations whose matrix is sparse, symmetric and positive-definite. Harwell Report R 7119, April 1972.
23. Sparse matrices and decomposition with applications to the solution of algebraic and differential equations. Harwell Report TP 500, September 1972. In "Decomposition of large-scale problems", ed. D.M. Himmelblau, North Holland, 1973.
24. Least squares solution of sparse systems of non-linear equations by a modified Marquardt algorithm. In "Decomposition of large-scale problems", ed. D.M. Himmelblau, North Holland, 1973.
25. Fortran subroutines for the solution of sparse systems of non- linear equations. Harwell Report R 7293, November 1972.
26. A Fortran subroutine for determining rapidly whether points are inside a plane region. Harwell Report R 7298, December 1972.
27. Monitoring the stability of the triangular factorization of a sparse matrix (with A.M. Erisman). Harwell Report TP 525, March 1973. Num. Math. 22, 183-186, 1974.
28. A comparison of sparsity orderings for obtaining a pivotal sequence in Gaussian elimination (with I.S. Duff). Harwell Report TP 526, March 1973. J. Inst. Maths. Applics., 14, 281-291, 1974.
29. Direct methods for sparse matrices. In "Software for numerical mathematics", ed. D.J. Evans, 29-47, Academic Press, 1974.
30. A discussion on a modified conjugate gradient method. Int. J. Num. Meth. Engrg. 8, 431-432, 1974.
31. On the reduction of sparse matrices to condensed forms by similarity transforms (with I.S. Duff). Harwell Report CSS 3. J. Inst. Maths. Applics. 15, 217-224, 1975.
32. Mesh generation. In "Finite element symposium 1974", ed. J.E. Crow, Atlas Laboratory, March 1975.
33. A comparison of some methods for the solution of sparse overdetermined systems of linear equations (with I.S. Duff). Harwell Report CSS 12, January 1975. J. Inst. Maths. Applics. 17 (1976), 267-280.
34. On George's nested dissection method (with I.S. Duff and A.M. Erisman). Harwell Report CSS 13, Feburary 1975. SIAM J. Numer. Anal. 13 (1976), 686-695.
35. Fortran subroutines for finding polynomial zeros (with K. Madsen). Harwell Report R 7986, February 1975.
36. A practical steepest-edge simplex algorithm (with D. Goldfarb). Harwell Report CSS 19, July 1975. Mathematical Programming 12 (1977), 361-371.
37. Sparse in-core linear programming. In "Numerical analysis, Dundee 1975", ed. G.A. Watson, Lecture notes on mathematics, 506, 176-189, Springer-Verlag.
38. A sparsity exploiting variant of the Bartels-Golub decomposition for linear programming bases. Harwell Report CSS 20, August 1975. Mathematical programming 24 (1982), 55-69.
39. Fortran subroutines for handling sparse linear programming bases. Harwell Report R 8269, January 1976.
40. An examination of FORTEV (with A.C. Day, P.A. Clarke, D. Hill). Comput. J. 19 (1976), 268-271.
41. An implementation of Tarjan's algorithm for the block triangularization of a matrix (with I.S. Duff). Harwell Report CSS 29, April 1976. ACM Trans. Math. Software 4 (1978), 137-147 and 189-192.
42. Sparse matrices. Harwell Report CSS 31, May 1976. In "The state of the art in numerical analysis", ed. D.A.H. Jacobs, Academic Press, 1977.
43. Solution of linear systems of equations: direct methods (general). Lecture notes for course in advanced sparse matrix techniques, Copenhagen, 1976, Springer-Verlag.
44. Two numerical analysts' views on the draft proposed ANS FORTRAN (with C.L. Lawson). In "Portability of numerical software", ed. W. Cowell, Lecture notes in Computer Science, 57, Springer-Verlag, 1977.
45. Direct solution of sets of linear equations whose matrix is sparse, symmetric and indefinite (with I.S. Duff, N. Munksgaard and H.B. Nielsen), Harwell Report CSS 44, January 1977. J. IMA. 23 (1979), 235-250.
46. Some design features of a sparse matrix code (with I.S. Duff). Harwell Report CSS 48, June 1977. ACM Trans. Math. Software 5 (1979), 18-35.
47. Software for Sparse Matrices. Harwell Report CSS 55, October 1977. In "Numerical software - needs and availability", ed. D.A.H. Jacobs, Academic Press, 1978.
48. A Fortran subroutine for comparing two files (with S. Marlow). Harwell Report R 8971, January 1978.
49. Performance evaluation of codes for sparse matrix problems (with I.S. Duff). Harwell Report CSS 66, December 1978. In "Performance evaluation of numerical software", ed. L.D. Fosdick, North Holland, 1979, 121-135.
50. Solving large full sets of linear equations in a paged virtual store (with J.J. Du Croz, S.M. Nugent and D.B. Taylor). Harwell Report CSS 68, December 1978. ACM Trans. Math. Software 7 (1981), 527-536 and 537-541.
51. Production, testing and documentation of mathematical software (with M.J. Hopper). Harwell Report CSS 75, April 1979. In "Production and assessment of numerical software", ed. M.A. Hennell and L.M. Delves, Academic Press, 1980, 19-39.
52. Functions for manipulating floating-point numbers. Harwell Report CSS 76, June 1979. SIGNUM Newsletter 14 (1979), 11-13 and Algol Bulletin 45 (1980), 6-15.
53. Finite-difference equations and their iterative solution. Direct solution of finite element and finite difference equations. Chapters 14/15 of "A survey of numerical methods for partial differential equations", ed. I. Gladwell and R. Wait, Clarendon Press, Oxford, 1979, 241-263.
54. Tracking the progress of Lanczos' algorithm for the very large symmetric eigenproblem (with B.N. Partlett). Harwell Report CSS 83, April 1980. IMA J. Num. Anal. (1981), 135-155.
55. A survey of sparse matrix computation. Harwell Report CSS 81, April 1980. In "Electric power problems: the mathematical challenge", ed. A.M. Erisman, K.W. Neves and M.H. Dwarakanath, SIAM 1981, 41-68.
56. Use of the WATFIV Fortran compiler at Harwell. Harwell Report R 9734, March 1980.
57. Solution of linear finite element equations. Harwell Report CSS 86. In "State-of-the-art surveys of finite element methods", ed. A.K. Noor and W.D. Pilkey, American Society of Mechanical Engineers, New York (1983), 163-181.
58. Frontal methods for solving finite-element systems of linear equations. In "Sparse matrices and their uses", ed. I.S. Duff, Academic Press, 1981, 265-281.
59. Language requirements for numerical software. Invited paper at ISO Fortran Experts Meeting, Amsterdam, October 1980.
60. Groups and internal procedures. ANSI Fortran (X3J3) paper 76(7)-LPM-2, January 1981.
61. General precision data type (with B.T. Smith). ANSI Fortran (X3J3) paper 77(9)-BTS-1, March 1981.
62. Data structures for sparse matrices. In "The relationship between numerical computation and programming languages", ed. J.K. Reid, North Holland, 1982, 153-161.
63. Experience of sparse matrix codes on the Cray-1 (with I.S. Duff). Harwell Report CSS 116. In "Vector and parallel processors in computational science", ed. P.G. Burke and L.M. Delves, Computer Physics Communications 26, 1982, 293-302.
64. Internal procedures / global data. ANSI Fortran (X3J3) paper 80(7)-LPM-2, December 1981.
65. MA27 - a set of Fortran subroutines for solving sparse symmetric sets of linear equations (with I.S. Duff). Harwell Report R 10533, April 1982.
66. The multifrontal solution of indefinite sparse symmetric linear systems (with I.S. Duff). Harwell Report CSS 122. ACM Trans. Math. Software 9 (1983), 302-325.
67. A note on the work involved in no-fill sparse matrix factorization (with I.S. Duff). Harwell Report CSS 130. IMA J. Numer. Anal., 3 (1983), 37-40.
68. The multifrontal solution of unsymmetric sets of linear equations (with I.S. Duff). SIAM J. Sci. Stat. Comp., 5 (1984), 633-641.
69. Advances in the exploitation of sparsity, Harwell Report CSS 138. In "Information processing 83", ed. R.E.A. Mason, North Holland, 1983, 901-908.
70. On solving almost block diagonal (staircase) linear systems (with A. Jennings). Harwell Report CSS 139. ACM Trans. Math. Software 10 (1984), 196-201.
71. NS02, a Fortran subroutine for solving sparse sets of non-linear equations by Powell's dog-leg algorithm (with N.S. Munksgaard). Harwell Report R 11047, October 1983.
72. TREESOLV, a Fortran package for solving large sets of linear finite-element equations. Harwell Report CSS 155. In "PDE software: modules, interfaces and systems", ed. B. Enquist and T. Smedsaas, North Holland, 1984, 1-17.
73. The array features in Fortran 8x. In "PDE software: modules, interfaces and systems", ed. B. Enquist and T. Smedsaas, North Holland, 1984, 351-354.
74. The use of linear programming for the solution of sparse sets of nonlinear equations (with I.S. Duff and J. Nocedal). Harwell Report CSS 145. SIAM J. Sci. Stat. Comput., 8 (1987), 99-108.
75. User documentation for Treesolve, a package of subroutines for solution of large sets of linear finite element equations. Harwell Report R 11420, September 1984.
76. The array features in Fortran 8x with examples of their use (with A. Wilson). In "Vector and parallel processors in computational science", ed. I.S. Duff and J.K. Reid, Computer Physics Communications, 37, 1985, 125-132.
77. TSSD: A typesetting system for scientific documents (with M.J. Hopper). In "PROTEXT I", ed. J.J.H. Miller, Boole Press, 1984, 216-221.
78. Sparsity structure and Gaussian elimination (with I.S. Duff, A.M. Erisman and C.W. Gear). Harwell Report CSS 171. SIGNUM Newsletter, 23 (1988), 2-8.
79. Sparse matrices. Harwell Report CSS 201, July 1986. In "The state of the art in numerical analysis", ed. A. Iserles and M.J.D Powell, Oxford University Press, 1987, 59-85.
80. Direct methods for sparse matrices (with I.S. Duff and A.M. Erisman). Oxford University Press (1986).
81. Algebraic aspects of finite-element solutions. In "Finite elements in physics", ed. R. Gruber, Computer Physics Reports, 6, 1987, 385-414.
82. Fortran 8x features that assist the exploitation of parallelism. In "Major advances in parallel processing", ed. C.R. Jesshope, Gower Technical Press, 1987, 247-252.
83. Using Fortran 8x to solve large problems. In "Simulation and optimization of large systems", ed. A.J. Osiadacz, Oxford University Press, 1988, 161-173.
84. Fortran 8x, the draft standard revision (with Jeanne Adams). Computer Standards and Interfaces, 7 (1988), 335-342.
85. Fortran 8x explained (with Michael Metcalf). Oxford University Press, 1987. Revised edition, 1989. Second revised edition (called Fortran 90 explained), 1990.
86. The multifrontal method in a parallel environment (with I.S. Duff, N.I.M. Gould and M. Lescrenier). Harwell Report CSS 211. In "Reliable numerical computation", ed. M.G. Cox and S. Hammarling, Oxford University Press, 1990, 93-111.
87. Fortran 8x, the new Fortran standard. Harwell Report R 12857, September 1987. Second edition, August 1989. Slightly modified version in Parallel Update, BCS Parallel Processing Specialist Group Newsletter 10 (1989), 46-58.
88. Use of the P4 and P5 algorithms for in-core factorization of sparse matrices (with M. Arioli, I.S. Duff and N.I.M. Gould). Harwell Report CSS 213, October 1987. SIAM J. Sci. Stat. Comput., 11, (1990) 913-927.
89. Sparse matrix computations. In "Applications of matrix theory", ed. M.J.C. Gover and S. Barnett, Oxford University Press, 1989, 101-121.
90. New crash procedures for large systems of linear constraints (with N.I.M. Gould). Harwell Report CSS 226, September 1988. In Mathematical Programming, 45 (1989), 475-501.
91. The use of profile reduction algorithms with a frontal code (with I.S. Duff and J.A. Scott) Harwell Report CSS 224, September 1988. In Int. J. Numer. Meth. Engrg., 28 (1989), 2555-2568.
92. Fortran 8x features and the exploitation of parallelism. In "Scientific software systems", ed. J.C. Mason and M.G.Cox, Chapman and Hall, 1990, 102-111.
93. The factorization of sparse symmetric indefinite matrices (with I.S. Duff, J.A. Scott, and K. Turner). Report RAL-90-066, Sept. 1990. Presented in preliminary form at the IMA Silver Jubilee Conference, September 1989. IMA J. Numer. Anal. (1991) 11, 181-204.
94. Solving large-scale sparse problems on supercomputers. Invited paper at the Second Australian Supercomputer Conference, December 1989.
95. Fortran 90, the new Fortran standard. .EXE. (1991), 6, 14-18.
96. Comments on version 3.1 of draft ISO/IEC 10967:1991, Language Comptible Arithmetic (with other members of IFIP WG 2.5). SIGNUM Newsletter (1992), 27, 2-3.
97. The advantages of Fortran 90. Report RAL-92-017 (PDF), March 1992. Computing (1992), 48, 219-238.
98. On PCF parallel Fortran extensions. ACM Fortran Forum (1992), 11, 17-23.
99. The Fortran 90 standard. In "Programming environments for high-level scientific problem solving, ed. P. W. Gaffney and E. N. Houstis, IFIP Transactions A-2, North-Holland, 1992, 343-348.
100. The use of Fortran 90 for scientific programming. In "Managing communications in a global marketplace", proceedings of SHARE Europe Spring meeting, March 30 - April 3, 1992, 585-596.
101. Language Independent Arithmetic - a draft international standard. SIGNUM Newsletter (1993), 28, 1, 2-7.
102. Computing a search direction for large-scale linearly-constrained nonlinear optimization calculations (with M. Arioli, T. F. Chan, I. S. Duff, and N. I. M. Gould). Report RAL-93-066 (PDF), October 1993.
103. MA48, a Fortran code for direct solution of sparse unsymmetric linear systems of equations (with I.S. Duff). Report RAL-93-072 (PDF), Oct. 1993.
104. The enable construct for exception handling in Fortran 90 (with IFIP Working Group 2.5). SIGNUM Newsletter (1993), 28, 4, 7-16.
105. Fortran 90 shapes up to the future. Scientific Computing (1995), 5, 16-22.
106. MA47, a Fortran code for direct solution of indefinite sparse symmetric linear systems (with I.S. Duff). Report RAL-95-001 (PDF), Jan. 1995.
107. The array features. Computer Standards and Interfaces (1996), 18, 323-331.
108. The design of MA48, a code for the direct solution of sparse unsymmetric linear systems of equations (with I.S. Duff). Report RAL-95-039 (PDF). ACM Trans. Math. Software (1996), 187-226.
109. Exploiting zeros on the diagonal in the direct solution of indefinite sparse symmetric linear systems (with I.S. Duff). Report RAL-95-040 (PDF). ACM Trans. Math. Software (1996), 227-257.
110. Exception handling in Fortran. ACM Fortran Forum, 14, 9-15 (1995).
111. MA46, a FORTRAN code for direct solution of sparse unsymmetric linear systems of equations from finite-element applications (with A. C. Damhaug). Report RAL-TR-96-010 (PDF), Feb., 1996.
112. Fortran 90/95 explained (with Michael Metcalf). Oxford University Press, 1996.
113. The F programming language (with Michael Metcalf). Oxford University Press, 1996.
114. Remark on "Fast Floating_point Processing in Common Lisp". ACM Trans. Math. Software (1996), 22, 496-497.
115. Two approaches to exception handling in Fortran 90. In "The quality of numerical software: assessment and enhancement", Ed. R. F. Boisvert, Chapman and Hall (1997), 210-223.
116. An appreciation of F. Fortran Journal, 8, 6 (1996), 3-9.
117. PARASOL interface to new parallel solvers for industrial applications (with Alexander Supalov and Clemens-August Thole). In Parallel Computing: Fundamentals, Applications and New Directions; E.H. D'Hollander, G.R. Joubert, F.J. Peters, U. Trottenberg (eds.) (1998). Advances in Parallel Computing 12, Elsevier, 525-532.
118. 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.
119. Implicit weighting for linear least squares problems. RAL-TR-98-027 (PDF), Mar., 1998. BIT (2000), 40, 146-157.
120. The impact of an efficient linear solver on finite-element analyses (with A. C. Damhaug and A. Bergseth), March 1998. Computer and Structures, 72 (1999), 595-604.
121. Writing a multigrid solver using Co-array Fortran (with R. W. Numrich and K. Kim). In Kagstrom, B., Dongarra, J., Elmroth, E. and Wasniewski, J. (eds.) (1998). Applied Parallel Computing. Proceedings of PARA'98, Umea, Sweden. Lecture Notes in Computer Science, 1541, Springer, 390-399.
122. 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.
123. AD01, A Fortran 90 code for automatic differentiation (with J. D. Pryce). RAL-TR-1998-057 (PDF), August 1998.
124. 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.
125. The LINPACK Benchmark in Co-Array Fortran (with J. M. Rasmussen and P. C. Hansen ). Technical Report IMM 14/2000, Institute of Mathematical Modelling Technical University of Denmark. Sixth European SGI/Cray MPP Workshop, Manchester, 7-8 September 2000 (http).
126. 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.
127. The new features of Fortran 2000. ACM Fortran Forum (2002), 21, 2 (Special Report). Revised version is RAL-TR-2002-030 (PDF).
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.
129. The future of Fortran. Computing in Science and Engineering (2003), 5, 4, 59-67.
130. Fortran 95/2003 Explained (with M. Metcalf and M. Cohen). Oxford University Press, 2004.
131. 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.
132. An overview of Fortran 2003. SIGPLAN Notices, 2004.
133. Fortran is getting more and more powerful. Invited talk at PARA'04, June 2004, Denmark. In "Applied Parallel Computing", Proceedings of PARA 2004, Ed. J. Dongarra, K. Madsen, and J. Wasniewski. Springer series: Lecture Notes in Computer Science.
134. 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.
135. Co-arrays in the next Fortran Standard (with R. W. Numrich). RAL-TR-2007-001. Fortran Forum (2005), 24, 2, 4-17.
136. Algorithm 865: Fortran 95 Subroutines for Cholesky Factorization in Blocked Hybrid Format (with Fred G. Gustavson, and J. Wasniewski), ACM Trans. Math. Software <33>, No. 1, Article 8, March 2007.
137. An out-of-core sparse Cholesky solver (with J. A. Scott). RAL-TR-2006-013 PDF), October 2006. ACM Trans. Math. Software, 36 (2009) 2 , 9, 1-33.
138. HSL_OF01, a virtual memory system in Fortran (with J. A. Scott). RAL-TR-2006-026 PDF) October 2006. Algorithm 891: A Fortran virtual memory system. ACM Trans. Math. Software 36 (2010), 1, 5, 1-11.
139. The design of a new out-of-core multifrontal solver (with J. A. Scott). PARA 2006 proceedings.
140. Guidelines for the development of HSL software (with J. A. Scott). RAL-TR-2006-031, December 2006. Superseded by 145.
141. Co-arrays in the next Fortran Standard (with R. W. Numrich), Scientific Programming (2006), 14, 1-18.
142. An efficient out-of-core multifrontal solver for large-scale unsymmetric element problems (with J. A. Scott). RAL-TR-2007-014 RAL-TR-2007-014, December 2007. Int. J. Numer. Meth. Engrg., 77 (2009), 901-921.
143. An approximate minimum degree algorithm for matrices with dense rows (with P. R. Amestoy, H. S. Dollar, and J. A. Scott). RAL-TR-2007-020, December 2007.
144. Migrating a scientific application from MPI to coarrays (with J. V. Ashby). CUG 2008 Proceedings. RAL-TR-2008-015, May 2008.
145. Guidelines for the development of HSL software (with J. A. Scott). RAL-TR-2008-027, August 2008. Supersedes 140.
146. An efficient out-of-core sparse symmetric indefinite direct solver (with J. A. Scott). (RAL-TR-2008-024), October 2008.
147. A DAG-based Sparse Cholesky Solver for Multicore Architectures. (with J. D. Hogg and J. A. Scott). RAL-TR-2008-004, April 2009. Revised version: Design of a multicore sparse Cholesky factorization using DAGs. RAL-TR-2009-027, December 2009. SIAM J. Sci. Comput., 32, (2010), 3627-3649.
148. Partial factorization of a dense symmetric indefinite matrix. (with J. A. Scott). RAL-TR-2009-015, August 2009.
149. A preconditioned block conjugate gradient algorithm for computing extreme eigenpairs of symmetric and Hermitian problems (with E. E. Ovtchinnkov). RAL-TR-2010-019, May 2010.