Anne Greenbaum

4.0k total citations · 1 hit paper
62 papers, 2.6k citations indexed

About

Anne Greenbaum is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Atomic and Molecular Physics, and Optics. According to data from OpenAlex, Anne Greenbaum has authored 62 papers receiving a total of 2.6k indexed citations (citations by other indexed papers that have themselves been cited), including 42 papers in Computational Theory and Mathematics, 18 papers in Numerical Analysis and 16 papers in Atomic and Molecular Physics, and Optics. Recurrent topics in Anne Greenbaum's work include Matrix Theory and Algorithms (42 papers), Electromagnetic Scattering and Analysis (15 papers) and Advanced Optimization Algorithms Research (13 papers). Anne Greenbaum is often cited by papers focused on Matrix Theory and Algorithms (42 papers), Electromagnetic Scattering and Analysis (15 papers) and Advanced Optimization Algorithms Research (13 papers). Anne Greenbaum collaborates with scholars based in United States, Czechia and Saudi Arabia. Anne Greenbaum's co-authors include Zdeněk Strakoš, Anita Mayo, Leslie Greengard, Vlastimil Pták, Garry Rodrigue, P.F. Dubois, Jack Dongarra, G. B. McFadden, James Demmel and Jeremy Du Croz and has published in prestigious journals such as Journal of Computational Physics, Mathematics of Computation and Computer Physics Communications.

In The Last Decade

Anne Greenbaum

58 papers receiving 2.2k citations

Hit Papers

Iterative Methods for Solving Linear Systems 1997 2026 2006 2016 1997 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
Anne Greenbaum United States 23 1.5k 872 810 754 355 62 2.6k
Gérard Meurant France 20 1.5k 1.0× 1.1k 1.2× 654 0.8× 679 0.9× 328 0.9× 68 2.3k
Gérard L. G. Sleijpen Netherlands 22 1.6k 1.1× 660 0.8× 1.1k 1.4× 873 1.2× 448 1.3× 68 2.7k
Daniel B. Szyld United States 30 2.4k 1.6× 933 1.1× 833 1.0× 1.4k 1.9× 376 1.1× 134 3.2k
Henk van der Vorst Netherlands 7 1.3k 0.9× 1.0k 1.2× 925 1.1× 553 0.7× 670 1.9× 11 3.7k
James M. Ortega United States 23 1.4k 0.9× 706 0.8× 367 0.5× 955 1.3× 344 1.0× 57 2.9k
Boris N. Khoromskij Germany 35 1.6k 1.1× 926 1.1× 1.1k 1.3× 311 0.4× 345 1.0× 115 3.3k
Karl Meerbergen Belgium 22 1.2k 0.8× 476 0.5× 537 0.7× 790 1.0× 334 0.9× 101 2.5k
Françoise Tisseur United Kingdom 25 1.9k 1.3× 397 0.5× 726 0.9× 1.3k 1.8× 288 0.8× 68 3.0k
J.M. Donato United States 11 929 0.6× 1.0k 1.2× 734 0.9× 371 0.5× 597 1.7× 18 3.2k
C.H. Romine United States 10 1.1k 0.7× 936 1.1× 681 0.8× 424 0.6× 606 1.7× 15 3.2k

Countries citing papers authored by Anne Greenbaum

Since Specialization
Citations

This map shows the geographic impact of Anne Greenbaum'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 Anne Greenbaum with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anne Greenbaum more than expected).

Fields of papers citing papers by Anne Greenbaum

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Anne Greenbaum. 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 Anne Greenbaum. The network helps show where Anne Greenbaum may publish in the future.

Co-authorship network of co-authors of Anne Greenbaum

This figure shows the co-authorship network connecting the top 25 collaborators of Anne Greenbaum. A scholar is included among the top collaborators of Anne Greenbaum 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 Anne Greenbaum. Anne Greenbaum 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.
Greenbaum, Anne, et al.. (2025). Optimal polynomial approximation to rational matrix functions using the Arnoldi algorithm. Numerical Algorithms. 100(4). 1657–1678.
2.
Crouzeix, Michel, Anne Greenbaum, & Kenan Li. (2024). Numerical bounds on the Crouzeix ratio for a class of matrices. CALCOLO. 61(2). 1 indexed citations
3.
Greenbaum, Anne, et al.. (2024). GMRES, pseudospectra, and Crouzeix’s conjecture for shifted and scaled Ginibre matrices. Mathematics of Computation. 94(351). 241–261. 1 indexed citations
4.
Greenbaum, Anne. (2023). Open Problems in the Analysis of Krylov Subspace Methods. Notices of the American Mathematical Society. 70(5). 1–1.
5.
Greenbaum, Anne, et al.. (2018). On the convergence rate of DGMRES. Linear Algebra and its Applications. 552. 219–238. 2 indexed citations
6.
Greenbaum, Anne & Michael L. Overton. (2017). Numerical investigation of Crouzeix's conjecture. Linear Algebra and its Applications. 542. 225–245. 10 indexed citations
7.
Driscoll, Tobin A., Alex Townsend, Jean‐Paul Berrut, et al.. (2016). New Directions in Numerical Computation. Notices of the American Mathematical Society. 63(4). 398–400.
8.
Greenbaum, Anne, et al.. (2011). Crouzeix’s conjecture and perturbed Jordan blocks. Linear Algebra and its Applications. 436(7). 2342–2352. 7 indexed citations
9.
Greenbaum, Anne. (2008). Upper and lower bounds on norms of functions of matrices. Linear Algebra and its Applications. 430(1). 52–65. 5 indexed citations
10.
Burke, James V. & Anne Greenbaum. (2006). Characterizations of the polynomial numerical hull of degree k. Linear Algebra and its Applications. 419(1). 37–47. 7 indexed citations
11.
Faber, Vance, Anne Greenbaum, & Donald E. Marshall. (2003). The polynomial numerical hulls of Jordan blocks and related matrices. Linear Algebra and its Applications. 374. 231–246. 14 indexed citations
12.
Greenbaum, Anne. (2002). Generalizations of the field of values useful in the study of polynomial functions of a matrix. Linear Algebra and its Applications. 347(1-3). 233–249. 38 indexed citations
13.
Greenbaum, Anne & Zdeněk Strakoš. (1992). Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations. SIAM Journal on Matrix Analysis and Applications. 13(1). 121–137. 74 indexed citations
14.
Sorensen, D. C., Zhong‐Zhi Bai, Jack Dongarra, et al.. (1990). LAPACK: A portable linear algebra library for high-performance computers. 2–11. 125 indexed citations
15.
Greenbaum, Anne. (1989). Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences. Linear Algebra and its Applications. 113. 7–63. 92 indexed citations
16.
Dongarra, Jack & Anne Greenbaum. (1989). Working Note 17: Experiments with QR/QL Methods For The Symmetric Tridiagonal Eigenproblem. 1 indexed citations
17.
Klein, Richard, et al.. (1989). A new scheme for multi-dimensional line transfer—I. Formulation and 1-D results. Journal of Quantitative Spectroscopy and Radiative Transfer. 41(3). 199–219. 11 indexed citations
18.
Bischof, C., James Demmel, Jack Dongarra, et al.. (1988). LAPACK Working Note #5 : Provisional Contents. Academic Radiology. 10 Suppl 1. S97–101. 7 indexed citations
19.
Greenbaum, Anne & James M. Ferguson. (1986). A Petrov-Galerkin finite element method for solving the neutron transport equation. Journal of Computational Physics. 64(1). 97–111. 7 indexed citations
20.
Greenbaum, Anne. (1981). Convergence properties of the conjugate gradient algorithm in exact and finite precision arithmetic. UMI Dissertation Information Service eBooks. 1 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