John K. Reid

Publication Activity (10 Years)

Years Active: 1966-2015
Publications (10 Years): 1

Top Topics

Image Denoising

National Library Of Medicine

Top Venues

J. Comput. Phys.

Publications

Sudip Garain, Dinshaw S. Balsara, John K. Reid
Comparing Coarray Fortran (CAF) with MPI for several structured mesh PDE applications. J. Comput. Phys. 297 (2015)
John K. Reid, Jennifer A. Scott
Partial factorization of a dense symmetric indefinite matrix. ACM Trans. Math. Softw. 38 (2) (2011)
Jonathan D. Hogg, John K. Reid, Jennifer A. Scott
Design of a Multicore Sparse Cholesky Factorization Using DAGs. SIAM J. Sci. Comput. 32 (6) (2010)
John K. Reid, Jennifer A. Scott
An out-of-core sparse Cholesky solver. ACM Trans. Math. Softw. 36 (2) (2009)
John K. Reid, Jennifer A. Scott
Algorithm 891: A fortran virtual memory system. ACM Trans. Math. Softw. 36 (1) (2009)
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) (2007)
John K. Reid, Robert W. Numrich
Co-arrays in the next Fortran Standard. Sci. Program. 15 (1) (2007)
John K. Reid, Jennifer A. Scott
Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix. SIAM J. Matrix Anal. Appl. 28 (3) (2006)
John K. Reid, Jennifer A. Scott
The Design of a New Out-of-Core Multifrontal Solver. PARA (2006)
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) (2005)
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) (2004)
John K. Reid
An overview of Fortran 2003. ACM SIGPLAN Notices 39 (8) (2004)
John K. Reid
Fortran Is Getting More and More Powerful. PARA (2004)
John K. Reid
Co-array Fortran for Full and Sparse Matrices. PARA (2002)
John K. Reid, Jennifer A. Scott
Implementing Hager's exchange methods for matrix profile reduction. ACM Trans. Math. Softw. 28 (4) (2002)
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)
John K. Reid, Jennifer A. Scott
Reversing the row order for the row-by-row frontal method. Numer. Linear Algebra Appl. 8 (1) (2001)
Robert W. Numrich, John K. Reid, Kieun Kim
Writing a Multigrid Solver Using Co-array Fortran. PARA (1998)
John K. Reid
Remark on "Fast Floating-Point Processing in Common Lisp". ACM Trans. Math. Softw. 22 (4) (1996)
Iain S. Duff, John K. Reid
Exploiting Zeros on the Diagonal in the Direct Solution of Indefinite Sparse Symmetric Linear Systems. ACM Trans. Math. Softw. 22 (2) (1996)
John K. Reid
The array features. Comput. Stand. Interfaces 18 (4) (1996)
John K. Reid
Two approaches to exeption handling in Fortran. Quality of Numerical Software (1996)
Iain S. Duff, John 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) (1996)
John K. Reid
The advantages of Fortran 90. Computing 48 (3-4) (1992)
John K. Reid
The Fortran 90 Standard. Programming Environments for High-Level Scientific Problem Solving (1991)
Mario Arioli, Iain S. Duff, Nick I. M. Gould, John K. Reid
Algorithms for In-Core Factorization of Sparse Matrices. SIAM J. Sci. Comput. 11 (5) (1990)
Nicholas I. M. Gould, John K. Reid
New crash procedures for large systems of linear constraints. Math. Program. 45 (1-3) (1989)
John K. Reid, Alan Jennings
On solving almost block diagonal (staircase) linear systems. ACM Trans. Math. Softw. 10 (2) (1984)
Iain S. Duff, John K. Reid
The Multifrontal Solution of Indefinite Sparse Symmetric Linear. ACM Trans. Math. Softw. 9 (3) (1983)
John K. Reid
Advances in the Exploitation of Sparsity. IFIP Congress (1983)
John K. Reid
A sparsity-exploiting variant of the Bartels - Golub decomposition for linear programming bases. Math. Program. 24 (1) (1982)
J. J. Du Croz, S. M. Nugent, John K. Reid, D. B. Taylor
Algorithm 578: Solution of Real Linear Equations in a Paged Virtual Store [F4]. ACM Trans. Math. Softw. 7 (4) (1981)
J. J. Du Croz, S. M. Nugent, John K. Reid, D. B. Taylor
Solving Large Full Sets of Linear Equations in a Paged Virtual Store. ACM Trans. Math. Softw. 7 (4) (1981)
Iain S. Duff, John K. Reid
Some Design Features of a Sparse Matrix Code. ACM Trans. Math. Softw. 5 (1) (1979)
Iain S. Duff, John K. Reid
Algorithm 529: Permutations To Block Triangular Form [F1]. ACM Trans. Math. Softw. 4 (2) (1978)
Iain S. Duff, John K. Reid
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix. ACM Trans. Math. Softw. 4 (2) (1978)
Donald Goldfarb, John K. Reid
A practicable steepest-edge simplex algorithm. Math. Program. 12 (1) (1977)
Charles L. Lawson, John K. Reid
Two Numerical Analyst's View on the Draft Proposed ANS Fortran. Portability of Numerical Software (1976)
A. R. Curtis, John K. Reid
The Solution of Large Sparse Unsymmetric Systems of Linear Equations. IFIP Congress (2) (1971)
John K. Reid
A Note on the Approximation of Plane Regions. Comput. J. 14 (3) (1971)
John K. Reid
Book Review: Semi-Groups of Operators and Approximation, by Paul L. Butzer and Hubert Berens, 1967; 318 pages. Comput. J. 12 (1) (1969)
M. J. D. Powell, John K. Reid
On applying Householder transformations to linear least squares problems. IFIP Congress (1) (1968)
John K. Reid
A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions. Comput. J. 10 (2) (1967)
John K. Reid
A Method for Finding the Optimum Successive Over-Relaxation Parameter. Comput. J. 9 (2) (1966)