Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
LAPACK Users' Guide
19991.5k citationsE. Anderson et al.Society for Industrial and Applied Mathematics eBooksprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of E. Anderson'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 E. Anderson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites E. Anderson more than expected).
This network shows the impact of papers produced by E. Anderson. 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 E. Anderson. The network helps show where E. Anderson may publish in the future.
Co-authorship network of co-authors of E. Anderson
This figure shows the co-authorship network connecting the top 25 collaborators of E. Anderson.
A scholar is included among the top collaborators of E. Anderson 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 E. Anderson. E. Anderson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
19 of 19 papers shown
1.
Anderson, E.. (2017). Algorithm 978. ACM Transactions on Mathematical Software. 44(1). 1–28.1 indexed citations
Anderson, E., Jack Dongarra, & Susan Ostrouchov. (1992). LAPACK Working Note 41: Installation Guide for LAPACK.15 indexed citations
11.
Anderson, E., et al.. (1991). LAPACK for Distributed Memory Architectures: Progress Report. Research Explorer (The University of Manchester). 625–630.14 indexed citations
12.
Anderson, E., Zhong‐Zhi Bai, & Jack Dongarra. (1991). LAPACK Working Note 31: Generalized QR Factorization and its Applications.1 indexed citations
13.
Anderson, E.. (1991). LAPACK Working Note No. 36: Robust Triangular Solves for Use in Condition Estimation.2 indexed citations
14.
Anderson, E. & Jack Dongarra. (1990). LAPACK Working Note 19: Evaluating Block Algorithm Variants in LAPACK.6 indexed citations
15.
Anderson, E., C. Bischof, J. Demmel, et al.. (1990). LAPACK Working Note 26: Prospectus for an Extension to LAPACK: A Portable Linear Algebra Library for High-Performance Computers.1 indexed citations
16.
Anderson, E. & Jack Dongarra. (1989). Evaluating Block Algorithm Variants in LAPACK. Research Explorer (The University of Manchester). 3–8.18 indexed citations
Anderson, E. & Yousef Saad. (1987). Preconditioned Conjugate Gradient Methods for General Sparse Matrices on Shared Memory Machines. 88–92.5 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.