Approximating the inverse of a matrix for use in iterative algorithms on vector processors. - Paul F. Dubois; Anne Greenbaum; Garry H. Rodrigue (Computing, 1979)

Synchronization costs on multiprocessors. - Anne Greenbaum (Parallel Comput., 1989)

LAPACK: a portable linear algebra library for high-performance computers. - Edward C. Anderson; Zhaojun Bai; Jack J. Dongarra; Anne Greenbaum; A. McKenney; Jeremy Du Croz; Sven Hammarling; James Demmel; Christian H. Bischof; Danny C. Sorensen (SC, 1990)

Diagonal Scalings of the Laplacian as Preconditioners for Other Elliptic Differential Operators. - Anne Greenbaum (SIAM J. Matrix Anal. Appl., 1992)

Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations. - Anne Greenbaum; Zdenek Strakos (SIAM J. Matrix Anal. Appl., 1992)

Fast Parallel Iterative Solution of Poisson's and the Biharmonic Equations on Irregular Regions. - Anita Mayo; Anne Greenbaum (SIAM J. Sci. Comput., 1992)

Max-Min Properties of Matrix Factor Norms. - Anne Greenbaum; Leonid Gurvits (SIAM J. Sci. Comput., 1994)

GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems. - Anne Greenbaum; Lloyd N. Trefethen (SIAM J. Sci. Comput., 1994)

A Further Note on Max-Min Properties of Matrix Factor Norms. - Leonid Gurvits; Anne Greenbaum (SIAM J. Sci. Comput., 1995)

Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems. - Jane Cullum; Anne Greenbaum (SIAM J. Matrix Anal. Appl., 1996)

Any Nonincreasing Convergence Curve is Possible for GMRES. - Anne Greenbaum; Vlastimil Pták; Zdenek Strakos (SIAM J. Matrix Anal. Appl., 1996)

Iterative methods for solving linear systems. - Anne Greenbaum (SIAM, 1997)

Estimating the Attainable Accuracy of Recursively Computed Residual Methods. - Anne Greenbaum (SIAM J. Matrix Anal. Appl., 1997)

Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions. - Vladimir Druskin; Anne Greenbaum; Leonid Knizhnerman (SIAM J. Sci. Comput., 1998)

LAPACK Users' Guide, Third Edition - Edward C. Anderson; Zhaojun Bai; Christian H. Bischof; L. Susan Blackford; James Demmel; Jack J. Dongarra; Jeremy Du Croz; Anne Greenbaum; Sven Hammarling; A. McKenney; Danny C. Sorensen (SIAM, 1999)

Card Shuffling and the Polynomial Numerical Hull of Degree k. - Anne Greenbaum (SIAM J. Sci. Comput., 2003)

Commentary. - Anne Greenbaum (Milestones in Matrix Computation, 2007)

Fourth order accurate evaluation of integrals in potential theory on exterior 3D regions. - Anita Mayo; Anne Greenbaum (J. Comput. Phys., 2007)

Global error bounds for the Petrov-Galerkin discretization of the neutron transport equation. - Britton Chang; Anne Greenbaum; Eric Machorro (Numer. Linear Algebra Appl., 2011)

Analysis of an aggregation-based algebraic two-grid method for a rotated anisotropic diffusion problem. - Meng-Huo Chen; Anne Greenbaum (Numer. Linear Algebra Appl., 2015)

Roots of Matrices in the Study of GMRES Convergence and Crouzeix's Conjecture. - Daeshik Choi; Anne Greenbaum (SIAM J. Matrix Anal. Appl., 2015)

An Algorithm for Finding a 2-Similarity Transformation from a Numerical Contraction to a Contraction. - Daeshik Choi; Anne Greenbaum (SIAM J. Matrix Anal. Appl., 2015)

Near Normal Dilations of Nonnormal Matrices and Linear Operators. - Anne Greenbaum; Trevor C. Caldwell; Kenan Li (SIAM J. Matrix Anal. Appl., 2016)

Variational analysis of the Crouzeix ratio. - Anne Greenbaum; Adrian S. Lewis; Michael L. Overton (Math. Program., 2017)

Some Extensions of the Crouzeix-Palencia Result. - Trevor C. Caldwell; Anne Greenbaum; Kenan Li (SIAM J. Matrix Anal. Appl., 2018)

Spectral Sets: Numerical Range and Beyond. - Michel Crouzeix; Anne Greenbaum (SIAM J. Matrix Anal. Appl., 2019)

Crouzeix's Conjecture and related problems. - Kelly Bickel; Pamela Gorkin; Anne Greenbaum; Thomas Ransford; Felix L. Schwenninger; Elias Wegert (CoRR, 2020)

First-Order Perturbation Theory for Eigenvalues and Eigenvectors. - Anne Greenbaum; Ren-Cang Li; Michael L. Overton (SIAM Rev., 2020)

On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic. - Anne Greenbaum; Hexuan Liu; Tyler Chen (SIAM J. Sci. Comput., 2021)

Error Bounds for Lanczos-Based Matrix Function Approximation. - Tyler Chen; Anne Greenbaum; Cameron Musco; Christopher Musco (SIAM J. Matrix Anal. Appl., 2022)

K-Spectral Sets. - Anne Greenbaum; Natalie Wellen (CoRR, 2023)

Near-Optimality Guarantees for Approximating Rational Matrix Functions by the Lanczos Method. - Noah Amsel; Tyler Chen; Anne Greenbaum; Cameron Musco; Christopher Musco (CoRR, 2023)

Optimal Polynomial Approximation to Rational Matrix Functions Using the Arnoldi Algorithm. - Tyler Chen; Anne Greenbaum; Natalie Wellen (CoRR, 2023)

Numerical bounds on the Crouzeix ratio for a class of matrices. - Michel Crouzeix; Anne Greenbaum; Kenan Li (CoRR, 2023)

Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation. - Tyler Chen; Anne Greenbaum; Cameron Musco; Christopher Musco (SIAM J. Matrix Anal. Appl., 2023)

Nearly Optimal Approximation of Matrix Functions by the Lanczos Method. - Noah Amsel; Tyler Chen; Anne Greenbaum; Cameron Musco; Christopher Musco (NeurIPS, 2024)

GMRES, pseudospectra, and Crouzeix's conjecture for shifted and scaled Ginibre matrices. - Tyler Chen; Anne Greenbaum; Thomas Trogdon (Math. Comput., 2024)

When is the Resolvent Like a Rank One Matrix? - Anne Greenbaum; Faranges Kyanfar; Abbas Salemi (CoRR, 2025)

Stable algorithms for general linear systems by preconditioning the normal equations. - Ethan N. Epperly; Anne Greenbaum; Yuji Nakatsukasa (CoRR, 2025)