default search action
John K. Reid
Person information
- affiliation: Rutherford Appleton Laboratory, Chilton, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j33]Sudip Garain
, Dinshaw S. Balsara, John K. Reid:
Comparing Coarray Fortran (CAF) with MPI for several structured mesh PDE applications. J. Comput. Phys. 297: 237-253 (2015) - 2011
- [j32]John K. Reid, Jennifer A. Scott
Partial factorization of a dense symmetric indefinite matrix. ACM Trans. Math. Softw. 38(2): 10:1-10:19 (2011) - 2010
- [j31]Jonathan D. Hogg
Design of a Multicore Sparse Cholesky Factorization Using DAGs. SIAM J. Sci. Comput. 32(6): 3627-3649 (2010)
2000 – 2009
- 2009
- [j30]John K. Reid, Jennifer A. Scott
Algorithm 891: A fortran virtual memory system. ACM Trans. Math. Softw. 36(1): 5:1-5:12 (2009) - [j29]John K. Reid, Jennifer A. Scott
An out-of-core sparse Cholesky solver. ACM Trans. Math. Softw. 36(2): 9:1-9:33 (2009) - 2007
- [j28]John K. Reid, Robert W. Numrich:
Co-arrays in the next Fortran Standard. Sci. Program. 15(1): 9-26 (2007) - [j27]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
- [j26]John K. Reid, Jennifer A. Scott:
Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix. SIAM J. Matrix Anal. Appl. 28(3): 805-821 (2006) - [c11]John K. Reid, Jennifer A. Scott
The Design of a New Out-of-Core Multifrontal Solver. PARA 2006: 598-607 - 2005
- [j25]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
- [j24]John K. Reid:
An overview of Fortran 2003. ACM SIGPLAN Notices 39(8): 31-38 (2004) - [j23]Shaun A. Forth
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) - [c10]John K. Reid:
Fortran Is Getting More and More Powerful. PARA 2004: 33-42 - 2002
- [j22]John K. Reid, Jennifer A. Scott
Implementing Hager's exchange methods for matrix profile reduction. ACM Trans. Math. Softw. 28(4): 377-391 (2002) - [c9]Mohamed Tadjouddine, Shaun A. Forth
Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation. International Conference on Computational Science (2) 2002: 1077-1086 - [c8]John K. Reid:
Co-array Fortran for Full and Sparse Matrices. PARA 2002: 61 - 2001
- [j21]John K. Reid, Jennifer A. Scott:
Reversing the row order for the row-by-row frontal method. Numer. Linear Algebra Appl. 8(1): 1-6 (2001)
1990 – 1999
- 1998
- [c7]Robert W. Numrich, John K. Reid, Kieun Kim:
Writing a Multigrid Solver Using Co-array Fortran. PARA 1998: 390-399 - 1996
- [j20]John K. Reid:
The array features. Comput. Stand. Interfaces 18(4): 323-331 (1996) - [j19]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): 187-226 (1996) - [j18]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): 227-257 (1996) - [j17]John K. Reid:
Remark on "Fast Floating-Point Processing in Common Lisp". ACM Trans. Math. Softw. 22(4): 496-497 (1996) - [c6]John K. Reid:
Two approaches to exeption handling in Fortran. Quality of Numerical Software 1996: 210-223 - 1992
- [j16]John K. Reid:
The advantages of Fortran 90. Computing 48(3-4): 219-238 (1992) - 1991
- [c5]John K. Reid:
The Fortran 90 Standard. Programming Environments for High-Level Scientific Problem Solving 1991: 343-348 - 1990
- [j15]Mario Arioli, Iain S. Duff, Nick I. M. Gould, John K. Reid:
Use of the P4 and P5 Algorithms for In-Core Factorization of Sparse Matrices. SIAM J. Sci. Comput. 11(5): 913-927 (1990)
1980 – 1989
- 1989
- [j14]Nicholas I. M. Gould
New crash procedures for large systems of linear constraints. Math. Program. 45(1-3): 475-501 (1989) - 1984
- [j13]John K. Reid, Alan Jennings:
On solving almost block diagonal (staircase) linear systems. ACM Trans. Math. Softw. 10(2): 196-215 (1984) - 1983
- [j12]Iain S. Duff, John K. Reid:
The Multifrontal Solution of Indefinite Sparse Symmetric Linear. ACM Trans. Math. Softw. 9(3): 302-325 (1983) - [c4]John K. Reid:
Advances in the Exploitation of Sparsity. IFIP Congress 1983: 901-908 - 1982
- [j11]John K. Reid:
A sparsity-exploiting variant of the Bartels - Golub decomposition for linear programming bases. Math. Program. 24(1): 55-69 (1982) - 1981
- [j10]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): 527-536 (1981) - [j9]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): 537-541 (1981)
1970 – 1979
- 1979
- [j8]Iain S. Duff, John K. Reid:
Some Design Features of a Sparse Matrix Code. ACM Trans. Math. Softw. 5(1): 18-35 (1979) - 1978
- [j7]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): 137-147 (1978) - [j6]Iain S. Duff, John K. Reid:
Algorithm 529: Permutations To Block Triangular Form [F1]. ACM Trans. Math. Softw. 4(2): 189-192 (1978) - 1977
- [j5]Donald Goldfarb, John K. Reid:
A practicable steepest-edge simplex algorithm. Math. Program. 12(1): 361-371 (1977) - 1976
- [c3]Charles L. Lawson, John K. Reid:
Two Numerical Analyst's View on the Draft Proposed ANS Fortran. Portability of Numerical Software 1976: 257-268 - 1971
- [j4]John K. Reid:
A Note on the Approximation of Plane Regions. Comput. J. 14(3): 307-308 (1971) - [c2]A. R. Curtis, John K. Reid:
The Solution of Large Sparse Unsymmetric Systems of Linear Equations. IFIP Congress (2) 1971: 1240-1245
1960 – 1969
- 1969
- [j3]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): 71 (1969) - 1968
- [c1]M. J. D. Powell, John K. Reid:
On applying Householder transformations to linear least squares problems. IFIP Congress (1) 1968: 122-126 - 1967
- [j2]John K. Reid:
A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions. Comput. J. 10(2): 188-189 (1967) - 1966
- [j1]John K. Reid:
A Method for Finding the Optimum Successive Over-Relaxation Parameter. Comput. J. 9(2): 200-204 (1966)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: