J. K. Reid

List of publications from the DBLP Bibliography Server - FAQCoauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Home Page

* | 2009 | |
---|---|---|

25 | EE | John K. Reid, Jennifer A. Scott: Algorithm 891: A fortran virtual memory system. ACM Trans. Math. Softw. 36(1): (2009) |

24 | EE | John K. Reid, Jennifer A. Scott: An out-of-core sparse Cholesky solver. ACM Trans. Math. Softw. 36(2): (2009) |

2007 | ||

23 | EE | Fred G. Gustavson, John K. Reid, Jerzy Wasniewski: Algorithm 865: Fortran 95 subroutines for Cholesky factorization in block hybrid format. ACM Trans. Math. Softw. 33(1): 8 (2007) |

2006 | ||

22 | EE | John K. Reid, Jennifer A. Scott: The Design of a New Out-of-Core Multifrontal Solver. PARA 2006: 598-607 |

2005 | ||

21 | EE | Bjarne Stig Andersen, John A. Gunnels, Fred G. Gustavson, John K. Reid, Jerzy Wasniewski: A fully portable high performance minimal storage hybrid format cholesky algorithm. ACM Trans. Math. Softw. 31(2): 201-227 (2005) |

2004 | ||

20 | EE | John K. Reid: Fortran Is Getting More and More Powerful. PARA 2004: 33-42 |

19 | EE | Shaun A. Forth, Mohamed Tadjouddine, John D. Pryce, John K. Reid: Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding. ACM Trans. Math. Softw. 30(3): 266-299 (2004) |

18 | EE | John K. Reid: An overview of Fortran 2003. SIGPLAN Notices 39(8): 31-38 (2004) |

2002 | ||

17 | EE | Mohamed Tadjouddine, Shaun A. Forth, John D. Pryce, John K. Reid: Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation. International Conference on Computational Science (2) 2002: 1077-1086 |

16 | EE | John K. Reid, Jennifer A. Scott: Implementing Hager's exchange methods for matrix profile reduction. ACM Trans. Math. Softw. 28(4): 377-391 (2002) |

1996 | ||

15 | J. K. Reid: Two approaches to exeption handling in Fortran. Quality of Numerical Software 1996: 210-223 | |

14 | EE | Iain S. Duff, J. K. Reid: The Design of MA48: A Code for the Direct Solution of Sparse Unsymmetric Linear Systems of Equations. ACM Trans. Math. Softw. 22(2): 187-226 (1996) |

13 | EE | Iain S. Duff, J. K. Reid: Exploiting Zeros on the Diagonal in the Direct Solution of Indefinite Sparse Symmetric Linear Systems. ACM Trans. Math. Softw. 22(2): 227-257 (1996) |

12 | EE | J. K. Reid: Remark on "Fast Floating-Point Processing in Common Lisp". ACM Trans. Math. Softw. 22(4): 496-497 (1996) |

1991 | ||

11 | J. K. Reid: The Fortran 90 Standard. Programming Environments for High-Level Scientific Problem Solving 1991: 343-348 | |

1983 | ||

10 | J. K. Reid: Advances in the Exploitation of Sparsity. IFIP Congress 1983: 901-908 | |

1981 | ||

9 | EE | J. J. Du Croz, S. M. Nugent, J. K. Reid, D. B. Taylor: Solving Large Full Sets of Linear Equations in a Paged Virtual Store. ACM Trans. Math. Softw. 7(4): 527-536 (1981) |

8 | EE | J. J. Du Croz, S. M. Nugent, J. K. Reid, D. B. Taylor: Algorithm 578: Solution of Real Linear Equations in a Paged Virtual Store [F4]. ACM Trans. Math. Softw. 7(4): 537-541 (1981) |

1979 | ||

7 | EE | Iain S. Duff, J. K. Reid: Some Design Features of a Sparse Matrix Code. ACM Trans. Math. Softw. 5(1): 18-35 (1979) |

1978 | ||

6 | EE | Iain S. Duff, J. K. Reid: An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix. ACM Trans. Math. Softw. 4(2): 137-147 (1978) |

5 | EE | Iain S. Duff, J. K. Reid: Algorithm 529: Permutations To Block Triangular Form [F1]. ACM Trans. Math. Softw. 4(2): 189-192 (1978) |

1976 | ||

4 | C. L. Lawson, J. K. Reid: Two Numerical Analyst's View on the Draft Proposed ANS Fortran. Portability of Numerical Software 1976: 257-268 | |

1971 | ||

3 | A. R. Curtis, J. K. Reid: The Solution of Large Sparse Unsymmetric Systems of Linear Equations. IFIP Congress (2) 1971: 1240-1245 | |

2 | J. K. Reid: A Note on the Approximation of Plane Regions. Comput. J. 14(3): 307-308 (1971) | |

1968 | ||

1 | M. J. D. Powell, J. K. Reid: On applying Householder transformations to linear least squares problems. IFIP Congress (1) 1968: 122-126 |

1 | Bjarne Stig Andersen | [21] |

2 | J. J. Du Croz | [8] [9] |

3 | A. R. Curtis | [3] |

4 | Iain S. Duff | [5] [6] [7] [13] [14] |

5 | Shaun A. Forth | [17] [19] |

6 | John A. Gunnels | [21] |

7 | Fred G. Gustavson | [21] [23] |

8 | C. L. Lawson | [4] |

9 | S. M. Nugent | [8] [9] |

10 | M. J. D. Powell | [1] |

11 | John D. Pryce | [17] [19] |

12 | Jennifer A. Scott | [16] [22] [24] [25] |

13 | Emmanuel M. Tadjouddine (Mohamed Tadjouddine) | [17] [19] |

14 | D. B. Taylor | [8] [9] |

15 | Jerzy Wasniewski | [21] [23] |