John Reid

6.7k total citations · 1 hit paper
105 papers, 3.9k citations indexed

About

John Reid is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Hardware and Architecture. According to data from OpenAlex, John Reid has authored 105 papers receiving a total of 3.9k indexed citations (citations by other indexed papers that have themselves been cited), including 61 papers in Computational Theory and Mathematics, 23 papers in Numerical Analysis and 22 papers in Hardware and Architecture. Recurrent topics in John Reid's work include Matrix Theory and Algorithms (38 papers), Advanced Optimization Algorithms Research (21 papers) and Parallel Computing and Optimization Techniques (21 papers). John Reid is often cited by papers focused on Matrix Theory and Algorithms (38 papers), Advanced Optimization Algorithms Research (21 papers) and Parallel Computing and Optimization Techniques (21 papers). John Reid collaborates with scholars based in United Kingdom, United States and Denmark. John Reid's co-authors include Iain Duff, Robert W. Numrich, J. A. Scott, A. R. Curtis, I. S. Duff, M. J. D. Powell, A. M. Erisman, Kathryn L. Turner, Donald Goldfarb and Michael Metcalf and has published in prestigious journals such as Journal of Computational Physics, Mathematics of Computation and International Journal for Numerical Methods in Engineering.

In The Last Decade

John Reid

92 papers receiving 3.3k citations

Hit Papers

The Multifrontal Solution of Indefinite Sparse Symmetric ... 1983 2026 1997 2011 1983 200 400 600

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
John Reid United Kingdom 32 1.9k 1.1k 941 869 725 105 3.9k
James R. Bunch United States 20 1.8k 0.9× 919 0.9× 397 0.4× 395 0.5× 710 1.0× 40 4.0k
Sven Hammarling United Kingdom 24 1.6k 0.8× 560 0.5× 1.8k 2.0× 1.3k 1.5× 391 0.5× 57 4.2k
Charles Van Loan United States 21 2.1k 1.1× 1.5k 1.4× 536 0.6× 558 0.6× 788 1.1× 42 6.1k
James M. Ortega United States 23 1.4k 0.7× 955 0.9× 389 0.4× 405 0.5× 706 1.0× 57 2.9k
Joseph W. H. Liu Canada 25 1.6k 0.8× 437 0.4× 652 0.7× 806 0.9× 470 0.6× 41 2.8k
Ahmed Sameh United States 34 1.4k 0.7× 431 0.4× 1.1k 1.2× 977 1.1× 688 0.9× 174 3.3k
Christian Bischof Germany 28 1.1k 0.6× 564 0.5× 554 0.6× 495 0.6× 760 1.0× 200 3.4k
Danny C. Sorensen United States 25 1.1k 0.6× 874 0.8× 354 0.4× 310 0.4× 1.2k 1.7× 51 4.1k
Kyle A. Gallivan United States 32 713 0.4× 776 0.7× 931 1.0× 793 0.9× 631 0.9× 147 3.5k
Stanley C. Eisenstat United States 25 2.7k 1.4× 1.8k 1.7× 381 0.4× 391 0.4× 1.9k 2.7× 59 5.3k

Countries citing papers authored by John Reid

Since Specialization
Citations

This map shows the geographic impact of John Reid's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by John Reid with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Reid more than expected).

Fields of papers citing papers by John Reid

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by John Reid. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by John Reid. The network helps show where John Reid may publish in the future.

Co-authorship network of co-authors of John Reid

This figure shows the co-authorship network connecting the top 25 collaborators of John Reid. A scholar is included among the top collaborators of John Reid based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with John Reid. John Reid is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Reid, John, et al.. (2005). Reducing the total bandwidth of a sparse unsymmetric matrix. 1 indexed citations
2.
Numrich, Robert W. & John Reid. (2005). Co-arrays in the next Fortran Standard. ACM SIGPLAN Fortran Forum. 24(2). 4–17. 57 indexed citations
3.
Metcalf, Michael & John Reid. (1999). Fortran 90/95 explained (2nd ed.). Oxford University Press eBooks. 15 indexed citations
4.
Reid, John, et al.. (1999). The impact of an efficient linear solver on finite element analyses. Computers & Structures. 72(4-5). 595–604. 4 indexed citations
5.
Numrich, Robert W. & John Reid. (1998). Co-array Fortran for parallel programming. ACM SIGPLAN Fortran Forum. 17(2). 1–31. 411 indexed citations
6.
Reid, John, et al.. (1996). MA46, a FORTRAN code for direct solution of sparse unsymmetric linear systems of equations from finite-element applications. CERN Document Server (European Organization for Nuclear Research). 5 indexed citations
7.
Duff, Iain & John Reid. (1995). MA47, a Fortran code for direct solution of indefinite sparse symmetric linear systems. CERN Document Server (European Organization for Nuclear Research). 34 indexed citations
8.
Duff, I. S. & John Reid. (1995). The Design of MA48, a code for the direct solution of sparse unsymmetric linear systems of equations. OpenGrey (Institut de l'Information Scientifique et Technique). 2 indexed citations
9.
Arioli, M., Tony F. Chan, Iain Duff, Nicholas I. M. Gould, & John Reid. (1993). Computing a search direction for large scale linearly constrained nonlinear optimization calculations. OpenGrey (Institut de l'Information Scientifique et Technique). 8 indexed citations
10.
Duff, I. S. & John Reid. (1993). MA48: A FORTRAN code for direct solution of sparse unsymmetric linear systems of equations. OpenGrey (Institut de l'Information Scientifique et Technique). 34 indexed citations
11.
Reid, John. (1992). The advantages of Fortran 90. Computing. 48(3-4). 219–238. 4 indexed citations
12.
Metcalf, Michael & John Reid. (1989). Fortran 8x explained (revised ed.). Clarendon Press eBooks. 2 indexed citations
13.
Duff, Iain, John Reid, & J. A. Scott. (1989). The use of profile reduction algorithms with a frontal code. International Journal for Numerical Methods in Engineering. 28(11). 2555–2568. 42 indexed citations
14.
Duff, Iain & John Reid. (1984). The Multifrontal Solution of Unsymmetric Sets of Linear Equations. SIAM Journal on Scientific and Statistical Computing. 5(3). 633–641. 148 indexed citations
15.
Reid, John. (1979). Functions for manipulating floating-point numbers. ACM SIGNUM Newsletter. 14(4). 11–13. 5 indexed citations
16.
Duff, Iain & John Reid. (1974). A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination. IMA Journal of Applied Mathematics. 14(3). 281–291. 25 indexed citations
17.
Curtis, A. R. & John Reid. (1972). On the Automatic Scaling of Matrices for Gaussian Elimination. IMA Journal of Applied Mathematics. 10(1). 118–124. 67 indexed citations
18.
Reid, John. (1971). Large sparse sets of linear equations : proceedings of the Oxford conference of the Institute of Mathematics and Its Applications held in April, 1970. Academic Press eBooks.
19.
Powell, M. J. D. & John Reid. (1968). On applying Householder transformations to linear least squares problems.. IFIP Congress. 91(8). 122–126. 44 indexed citations
20.
Reid, John. (1967). A Note on the Least Squares Solution of a Band System of Linear Equations by Householder Reductions. The Computer Journal. 10(2). 188–189. 21 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026