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.
The singular value decomposition: Its computation and some applications
19801.1k citationsVirginia Klema, Alan J. LaubIEEE Transactions on Automatic Controlprofile →
Matrix Eigensystem Routines — EISPACK Guide
1976584 citationsJack Dongarra, Virginia Klema et al.Lecture notes in computer scienceprofile →
LINPACK User's Guide.
1980499 citationsVirginia Klema, Jack Dongarra et al.Mathematics of Computationprofile →
Matrix Eigensystem Routines--EISPACK Guide
1976482 citationsThomas Aird, Brian T. Smith et al.Mathematics of Computationprofile →
Countries citing papers authored by Virginia Klema
Since
Specialization
Citations
This map shows the geographic impact of Virginia Klema'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 Virginia Klema with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Virginia Klema more than expected).
This network shows the impact of papers produced by Virginia Klema. 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 Virginia Klema. The network helps show where Virginia Klema may publish in the future.
Co-authorship network of co-authors of Virginia Klema
This figure shows the co-authorship network connecting the top 25 collaborators of Virginia Klema.
A scholar is included among the top collaborators of Virginia Klema 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 Virginia Klema. Virginia Klema is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
1964·Mathematics of Computation·(unknown),
Virginia Klema
2
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.