# John K. Reid

Affiliations:- Rutherford Appleton Laboratory, Chilton, UK

According to our database

Collaborative distances:

^{1}, John K. Reid authored at least 44 papers between 1966 and 2015.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2015

Comparing Coarray Fortran (CAF) with MPI for several structured mesh PDE applications.

J. Comput. Phys., 2015

2011

ACM Trans. Math. Softw., 2011

2010

SIAM J. Sci. Comput., 2010

2009

ACM Trans. Math. Softw., 2009

ACM Trans. Math. Softw., 2009

2007

Algorithm 865: Fortran 95 subroutines for Cholesky factorization in block hybrid format.

ACM Trans. Math. Softw., 2007

Sci. Program., 2007

2006

SIAM J. Matrix Anal. Appl., 2006

Proceedings of the Applied Parallel Computing. State of the Art in Scientific Computing, 2006

2005

A fully portable high performance minimal storage hybrid format cholesky algorithm.

ACM Trans. Math. Softw., 2005

2004

Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding.

ACM Trans. Math. Softw., 2004

ACM SIGPLAN Notices, 2004

Proceedings of the Applied Parallel Computing, 2004

2002

ACM Trans. Math. Softw., 2002

Proceedings of the Applied Parallel Computing Advanced Scientific Computing, 2002

Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation.

Proceedings of the Computational Science - ICCS 2002, 2002

2001

Numer. Linear Algebra Appl., 2001

1998

Proceedings of the Applied Parallel Computing, 1998

1996

ACM Trans. Math. Softw., 1996

Exploiting Zeros on the Diagonal in the Direct Solution of Indefinite Sparse Symmetric Linear Systems.

ACM Trans. Math. Softw., 1996

The Design of MA48: A Code for the Direct Solution of Sparse Unsymmetric Linear Systems of Equations.

ACM Trans. Math. Softw., 1996

Comput. Stand. Interfaces, 1996

Two approaches to exeption handling in Fortran.

Proceedings of the Quality of Numerical Software, 1996

1992

Computing, 1992

1991

The Fortran 90 Standard.

Proceedings of the Programming Environments for High-Level Scientific Problem Solving, 1991

1990

Use of the P<sup>4</sup> and P<sup>5</sup> Algorithms for In-Core Factorization of Sparse Matrices.

SIAM J. Sci. Comput., 1990

1989

Math. Program., 1989

1984

ACM Trans. Math. Softw., 1984

1983

ACM Trans. Math. Softw., 1983

Advances in the Exploitation of Sparsity.

Proceedings of the Information Processing 83, 1983

1982

A sparsity-exploiting variant of the Bartels - Golub decomposition for linear programming bases.

Math. Program., 1982

1981

ACM Trans. Math. Softw., 1981

ACM Trans. Math. Softw., 1981

1979

ACM Trans. Math. Softw., 1979

1978

ACM Trans. Math. Softw., 1978

An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix.

ACM Trans. Math. Softw., 1978

1977

Math. Program., 1977

1976

Proceedings of the Portability of Numerical Software, 1976

1971

Comput. J., 1971

The Solution of Large Sparse Unsymmetric Systems of Linear Equations.

Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 2, 1971

1969

Book Review: Semi-Groups of Operators and Approximation, by Paul L. Butzer and Hubert Berens, 1967; 318 pages.

Comput. J., 1969

1968

On applying Householder transformations to linear least squares problems.

Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968

1967

A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions.

Comput. J., 1967

1966

Comput. J., 1966