John K. Reid

44 papers Misc 1Journal 33Unranked 10
YearRankTypeTitle / Venue / Authors
2015 J jnl
Comparing Coarray Fortran (CAF) with MPI for several structured mesh PDE applications.
J. Comput. Phys.
Sudip Garain, Dinshaw S. Balsara, John K. Reid
2011 J jnl
Partial factorization of a dense symmetric indefinite matrix.
ACM Trans. Math. Softw.
John K. Reid, Jennifer A. Scott
2010 J jnl
Design of a Multicore Sparse Cholesky Factorization Using DAGs.
SIAM J. Sci. Comput.
Jonathan D. Hogg, John K. Reid, Jennifer A. Scott
2009 J jnl
Algorithm 891: A fortran virtual memory system.
ACM Trans. Math. Softw.
John K. Reid, Jennifer A. Scott
2009 J jnl
An out-of-core sparse Cholesky solver.
ACM Trans. Math. Softw.
John K. Reid, Jennifer A. Scott
2007 J jnl
Algorithm 865: Fortran 95 subroutines for Cholesky factorization in block hybrid format.
ACM Trans. Math. Softw.
Fred G. Gustavson, John K. Reid, Jerzy Wasniewski
2007 J jnl
Co-arrays in the next Fortran Standard.
Sci. Program.
John K. Reid, Robert W. Numrich
2006 J jnl
Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix.
SIAM J. Matrix Anal. Appl.
John K. Reid, Jennifer A. Scott
2006 — conf
The Design of a New Out-of-Core Multifrontal Solver.
PARA
John K. Reid, Jennifer A. Scott
2005 J jnl
A fully portable high performance minimal storage hybrid format cholesky algorithm.
ACM Trans. Math. Softw.
Bjarne Stig Andersen, John A. Gunnels, Fred G. Gustavson, John K. Reid, Jerzy Wasniewski
2004 J jnl
An overview of Fortran 2003.
ACM SIGPLAN Notices
John K. Reid
2004 — conf
Fortran Is Getting More and More Powerful.
PARA
John K. Reid
2004 J jnl
Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding.
ACM Trans. Math. Softw.
Shaun A. Forth, Mohamed Tadjouddine, John D. Pryce, John K. Reid
2002 — conf
Co-array Fortran for Full and Sparse Matrices.
PARA
John K. Reid
2002 J jnl
Implementing Hager's exchange methods for matrix profile reduction.
ACM Trans. Math. Softw.
John K. Reid, Jennifer A. Scott
2002 Misc conf
Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation.
International Conference on Computational Science (2)
Mohamed Tadjouddine, Shaun A. Forth, John D. Pryce, John K. Reid
2001 J jnl
Reversing the row order for the row-by-row frontal method.
Numer. Linear Algebra Appl.
John K. Reid, Jennifer A. Scott
1998 — conf
Writing a Multigrid Solver Using Co-array Fortran.
PARA
Robert W. Numrich, John K. Reid, Kieun Kim
1996 J jnl
Exploiting Zeros on the Diagonal in the Direct Solution of Indefinite Sparse Symmetric Linear Systems.
ACM Trans. Math. Softw.
Iain S. Duff, John K. Reid
1996 J jnl
Remark on "Fast Floating-Point Processing in Common Lisp".
ACM Trans. Math. Softw.
John K. Reid
1996 J jnl
The Design of MA48: A Code for the Direct Solution of Sparse Unsymmetric Linear Systems of Equations.
ACM Trans. Math. Softw.
Iain S. Duff, John K. Reid
1996 J jnl
The array features.
Comput. Stand. Interfaces
John K. Reid
1996 — conf
Two approaches to exeption handling in Fortran.
Quality of Numerical Software
John K. Reid
1992 J jnl
The advantages of Fortran 90.
Computing
John K. Reid
1991 — conf
The Fortran 90 Standard.
Programming Environments for High-Level Scientific Problem Solving
John K. Reid
1990 J jnl
Use of the P
SIAM J. Sci. Comput.
Mario Arioli, Iain S. Duff, Nick I. M. Gould, John K. Reid
1989 J jnl
New crash procedures for large systems of linear constraints.
Math. Program.
Nicholas I. M. Gould, John K. Reid
1984 J jnl
On solving almost block diagonal (staircase) linear systems.
ACM Trans. Math. Softw.
John K. Reid, Alan Jennings
1983 — conf
Advances in the Exploitation of Sparsity.
IFIP Congress
John K. Reid
1983 J jnl
The Multifrontal Solution of Indefinite Sparse Symmetric Linear.
ACM Trans. Math. Softw.
Iain S. Duff, John K. Reid
1982 J jnl
A sparsity-exploiting variant of the Bartels - Golub decomposition for linear programming bases.
Math. Program.
John K. Reid
1981 J jnl
Algorithm 578: Solution of Real Linear Equations in a Paged Virtual Store [F4].
ACM Trans. Math. Softw.
J. J. Du Croz, S. M. Nugent, John K. Reid, D. B. Taylor
1981 J jnl
Solving Large Full Sets of Linear Equations in a Paged Virtual Store.
ACM Trans. Math. Softw.
J. J. Du Croz, S. M. Nugent, John K. Reid, D. B. Taylor
1979 J jnl
Some Design Features of a Sparse Matrix Code.
ACM Trans. Math. Softw.
Iain S. Duff, John K. Reid
1978 J jnl
Algorithm 529: Permutations To Block Triangular Form [F1].
ACM Trans. Math. Softw.
Iain S. Duff, John K. Reid
1978 J jnl
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix.
ACM Trans. Math. Softw.
Iain S. Duff, John K. Reid
1977 J jnl
A practicable steepest-edge simplex algorithm.
Math. Program.
Donald Goldfarb, John K. Reid
1976 — conf
Two Numerical Analyst's View on the Draft Proposed ANS Fortran.
Portability of Numerical Software
Charles L. Lawson, John K. Reid
1971 J jnl
A Note on the Approximation of Plane Regions.
Comput. J.
John K. Reid
1971 — conf
The Solution of Large Sparse Unsymmetric Systems of Linear Equations.
IFIP Congress (2)
A. R. Curtis, John K. Reid
1969 J jnl
Book Review: Semi-Groups of Operators and Approximation, by Paul L. Butzer and Hubert Berens, 1967; 318 pages.
Comput. J.
John K. Reid
1968 — conf
On applying Householder transformations to linear least squares problems.
IFIP Congress (1)
M. J. D. Powell, John K. Reid
1967 J jnl
A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions.
Comput. J.
John K. Reid
1966 J jnl
A Method for Finding the Optimum Successive Over-Relaxation Parameter.
Comput. J.
John K. Reid