DBLP: John K. Reid

	2011
j21		John K. Reid, Jennifer A. Scott: Partial factorization of a dense symmetric indefinite matrix. ACM Trans. Math. Softw. 38(2): 10 (2011)
	2010
j20		J. D. Hogg, John K. Reid, Jennifer A. Scott: Design of a Multicore Sparse Cholesky Factorization Using DAGs. SIAM J. Scientific Computing 32(6): 3627-3649 (2010)
	2009
j19		John K. Reid, Jennifer A. Scott: Algorithm 891: A fortran virtual memory system. ACM Trans. Math. Softw. 36(1) (2009)
j18		John K. Reid, Jennifer A. Scott: An out-of-core sparse Cholesky solver. ACM Trans. Math. Softw. 36(2) (2009)
	2007
j17		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
j16		J. K. Reid, J. A. Scott: Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix. SIAM J. Matrix Analysis Applications 28(3): 805-821 (2006)
c9		John K. Reid, Jennifer A. Scott: The Design of a New Out-of-Core Multifrontal Solver. PARA 2006: 598-607
	2005
j15		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
j14		John K. Reid: An overview of Fortran 2003. SIGPLAN Notices 39(8): 31-38 (2004)
j13		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)
c8		John K. Reid: Fortran Is Getting More and More Powerful. PARA 2004: 33-42
	2002
j12		John K. Reid, Jennifer A. Scott: Implementing Hager's exchange methods for matrix profile reduction. ACM Trans. Math. Softw. 28(4): 377-391 (2002)
c7		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
	1996
j11		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)
j10		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)
j9		J. K. Reid: Remark on "Fast Floating-Point Processing in Common Lisp". ACM Trans. Math. Softw. 22(4): 496-497 (1996)
c6		J. K. Reid: Two approaches to exeption handling in Fortran. Quality of Numerical Software 1996: 210-223
	1991
c5		J. K. Reid: The Fortran 90 Standard. Programming Environments for High-Level Scientific Problem Solving 1991: 343-348
	1984
j8		J. K. Reid, A. Jennings: On solving almost block diagonal (staircase) linear systems. ACM Trans. Math. Softw. 10(2): 196-215 (1984)
	1983
j7		Iain S. Duff, John K. Reid: The Multifrontal Solution of Indefinite Sparse Symmetric Linear. ACM Trans. Math. Softw. 9(3): 302-325 (1983)
c4		J. K. Reid: Advances in the Exploitation of Sparsity. IFIP Congress 1983: 901-908
	1981
j6		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)
j5		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
j4		Iain S. Duff, J. K. Reid: Some Design Features of a Sparse Matrix Code. ACM Trans. Math. Softw. 5(1): 18-35 (1979)
	1978
j3		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)
j2		Iain S. Duff, J. K. Reid: Algorithm 529: Permutations To Block Triangular Form [F1]. ACM Trans. Math. Softw. 4(2): 189-192 (1978)
	1976
c3		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
j1		J. K. Reid: A Note on the Approximation of Plane Regions. Comput. J. 14(3): 307-308 (1971)
c2		A. R. Curtis, J. K. Reid: The Solution of Large Sparse Unsymmetric Systems of Linear Equations. IFIP Congress (2) 1971: 1240-1245
	1968
c1		M. J. D. Powell, J. K. Reid: On applying Householder transformations to linear least squares problems. IFIP Congress (1) 1968: 122-126

2011

j21

John K. Reid, Jennifer A. Scott: Partial factorization of a dense symmetric indefinite matrix. ACM Trans. Math. Softw. 38(2): 10 (2011)

2010

j20

J. D. Hogg, John K. Reid, Jennifer A. Scott: Design of a Multicore Sparse Cholesky Factorization Using DAGs. SIAM J. Scientific Computing 32(6): 3627-3649 (2010)

2009

j19

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

j18

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

2007

j17

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

j16

J. K. Reid, J. A. Scott: Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix. SIAM J. Matrix Analysis Applications 28(3): 805-821 (2006)

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

2005

j15

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

j14

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

j13

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)

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

2002

j12

John K. Reid, Jennifer A. Scott: Implementing Hager's exchange methods for matrix profile reduction. ACM Trans. Math. Softw. 28(4): 377-391 (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: 1077-1086

1996

j11

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)

j10

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)

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

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

1991

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

1984

J. K. Reid, A. Jennings: On solving almost block diagonal (staircase) linear systems. ACM Trans. Math. Softw. 10(2): 196-215 (1984)

1983

Iain S. Duff, John K. Reid: The Multifrontal Solution of Indefinite Sparse Symmetric Linear. ACM Trans. Math. Softw. 9(3): 302-325 (1983)

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

1981

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)

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

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

1978

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)

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

1976

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

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

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

1968

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	[j15]
2	J. J. Du Croz	[j6] [j5]
3	A. R. Curtis	[c2]
4	Iain S. Duff	[j11] [j10] [j7] [j4] [j3] [j2]
5	Shaun A. Forth	[j13] [c7]
6	John A. Gunnels	[j15]
7	Fred G. Gustavson	[j17] [j15]
8	J. D. Hogg	[j20]
9	A. Jennings	[j8]
10	C. L. Lawson	[c3]
11	S. M. Nugent	[j6] [j5]
12	M. J. D. Powell	[c1]
13	John D. Pryce	[j13] [c7]
14	J. A. Scott	[j16]
15	Jennifer A. Scott	[j21] [j20] [j19] [j18] [c9] [j12]
16	Emmanuel M. Tadjouddine (Mohamed Tadjouddine)	[j13] [c7]
17	D. B. Taylor	[j6] [j5]
18	Jerzy Wasniewski	[j17] [j15]

John K. Reid

Coauthor Index