default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnne Greenbaum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Tyler Chen, Anne Greenbaum, Thomas Trogdon:
GMRES, pseudospectra, and Crouzeix's conjecture for shifted and scaled Ginibre matrices. Math. Comput. 94(351): 241-261 (2024)- 2023
- [j26]Tyler Chen
, Anne Greenbaum, Cameron Musco, Christopher Musco:
Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation. SIAM J. Matrix Anal. Appl. 44(2): 670-692 (2023) - [i10]Anne Greenbaum, Natalie Wellen:
K-Spectral Sets. CoRR abs/2302.05535 (2023) - [i9]Tyler Chen, Anne Greenbaum, Thomas Trogdon:
GMRES, pseudospectra, and Crouzeix's conjecture for shifted and scaled Ginibre matrices. CoRR abs/2303.02042 (2023) - [i8]Noah Amsel, Tyler Chen, Anne Greenbaum, Cameron Musco, Christopher Musco:
Near-Optimality Guarantees for Approximating Rational Matrix Functions by the Lanczos Method. CoRR abs/2303.03358 (2023) - [i7]Tyler Chen, Anne Greenbaum, Natalie Wellen:
Optimal Polynomial Approximation to Rational Matrix Functions Using the Arnoldi Algorithm. CoRR abs/2306.17308 (2023) - [i6]Michel Crouzeix, Anne Greenbaum, Kenan Li:
Numerical bounds on the Crouzeix ratio for a class of matrices. CoRR abs/2311.13890 (2023) - 2022
- [j25]Tyler Chen, Anne Greenbaum, Cameron Musco, Christopher Musco:
Error Bounds for Lanczos-Based Matrix Function Approximation. SIAM J. Matrix Anal. Appl. 43(2): 787-811 (2022) - [i5]Tyler Chen, Anne Greenbaum, Cameron Musco, Christopher Musco:
Low-memory Krylov subspace methods for optimal rational matrix function approximation. CoRR abs/2202.11251 (2022) - 2021
- [j24]Anne Greenbaum, Hexuan Liu, Tyler Chen:
On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic. SIAM J. Sci. Comput. 43(5): S496-S515 (2021) - [i4]Tyler Chen, Anne Greenbaum, Cameron Musco, Christopher Musco:
Error bounds for Lanczos-based matrix function approximation. CoRR abs/2106.09806 (2021) - 2020
- [j23]Anne Greenbaum, Ren-Cang Li, Michael L. Overton:
First-Order Perturbation Theory for Eigenvalues and Eigenvectors. SIAM Rev. 62(2): 463-482 (2020) - [i3]Kelly Bickel, Pamela Gorkin, Anne Greenbaum, Thomas Ransford, Felix L. Schwenninger, Elias Wegert:
Crouzeix's Conjecture and related problems. CoRR abs/2006.04901 (2020)
2010 – 2019
- 2019
- [j22]Michel Crouzeix, Anne Greenbaum:
Spectral Sets: Numerical Range and Beyond. SIAM J. Matrix Anal. Appl. 40(3): 1087-1101 (2019) - [i2]Anne Greenbaum, Ren-Cang Li, Michael L. Overton:
First-order Perturbation Theory for Eigenvalues and Eigenvectors. CoRR abs/1903.00785 (2019) - [i1]Anne Greenbaum, Hexuan Liu, Tyler Chen:
On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic. CoRR abs/1905.05874 (2019) - 2018
- [j21]Trevor C. Caldwell, Anne Greenbaum, Kenan Li:
Some Extensions of the Crouzeix-Palencia Result. SIAM J. Matrix Anal. Appl. 39(2): 769-780 (2018) - 2017
- [j20]Anne Greenbaum, Adrian S. Lewis, Michael L. Overton:
Variational analysis of the Crouzeix ratio. Math. Program. 164(1-2): 229-243 (2017) - 2016
- [j19]Anne Greenbaum, Trevor C. Caldwell, Kenan Li:
Near Normal Dilations of Nonnormal Matrices and Linear Operators. SIAM J. Matrix Anal. Appl. 37(4): 1365-1381 (2016) - 2015
- [j18]Meng-Huo Chen, Anne Greenbaum:
Analysis of an aggregation-based algebraic two-grid method for a rotated anisotropic diffusion problem. Numer. Linear Algebra Appl. 22(4): 681-701 (2015) - [j17]Daeshik Choi, Anne Greenbaum:
Roots of Matrices in the Study of GMRES Convergence and Crouzeix's Conjecture. SIAM J. Matrix Anal. Appl. 36(1): 289-301 (2015) - [j16]Daeshik Choi, Anne Greenbaum:
An Algorithm for Finding a 2-Similarity Transformation from a Numerical Contraction to a Contraction. SIAM J. Matrix Anal. Appl. 36(3): 1248-1262 (2015) - 2011
- [j15]Britton Chang, Anne Greenbaum, Eric Machorro:
Global error bounds for the Petrov-Galerkin discretization of the neutron transport equation. Numer. Linear Algebra Appl. 18(1): 141-154 (2011)
2000 – 2009
- 2007
- [j14]Anita Mayo, Anne Greenbaum:
Fourth order accurate evaluation of integrals in potential theory on exterior 3D regions. J. Comput. Phys. 220(2): 900-914 (2007) - [p1]Anne Greenbaum:
Commentary. Milestones in Matrix Computation 2007: 35-44 - 2003
- [j13]Anne Greenbaum:
Card Shuffling and the Polynomial Numerical Hull of Degree k. SIAM J. Sci. Comput. 25(2): 408-416 (2003)
1990 – 1999
- 1999
- [b2]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:
LAPACK Users' Guide, Third Edition. Software, Environments and Tools, SIAM 1999, ISBN 978-0-89871-447-0, pp. 1-404 - 1998
- [j12]Vladimir Druskin, Anne Greenbaum, Leonid Knizhnerman:
Using Nonorthogonal Lanczos Vectors in the Computation of Matrix Functions. SIAM J. Sci. Comput. 19(1): 38-54 (1998) - 1997
- [b1]Anne Greenbaum:
Iterative methods for solving linear systems. Frontiers in applied mathematics 17, SIAM 1997, ISBN 978-0-89871-396-1, pp. I-XIII, 1-220 - [j11]Anne Greenbaum:
Estimating the Attainable Accuracy of Recursively Computed Residual Methods. SIAM J. Matrix Anal. Appl. 18(3): 535-551 (1997) - 1996
- [j10]Jane Cullum, Anne Greenbaum:
Relations between Galerkin and Norm-Minimizing Iterative Methods for Solving Linear Systems. SIAM J. Matrix Anal. Appl. 17(2): 223-247 (1996) - [j9]Anne Greenbaum, Vlastimil Pták, Zdenek Strakos:
Any Nonincreasing Convergence Curve is Possible for GMRES. SIAM J. Matrix Anal. Appl. 17(3): 465-469 (1996) - 1995
- [j8]Leonid Gurvits, Anne Greenbaum:
A Further Note on Max-Min Properties of Matrix Factor Norms. SIAM J. Sci. Comput. 16(2): 496-499 (1995) - 1994
- [j7]Anne Greenbaum, Leonid Gurvits:
Max-Min Properties of Matrix Factor Norms. SIAM J. Sci. Comput. 15(2): 348-358 (1994) - [j6]Anne Greenbaum, Lloyd N. Trefethen:
GMRES/CR and Arnoldi/Lanczos as Matrix Approximation Problems. SIAM J. Sci. Comput. 15(2): 359-368 (1994) - 1992
- [j5]Anne Greenbaum, Zdenek Strakos:
Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations. SIAM J. Matrix Anal. Appl. 13(1): 121-137 (1992) - [j4]Anne Greenbaum:
Diagonal Scalings of the Laplacian as Preconditioners for Other Elliptic Differential Operators. SIAM J. Matrix Anal. Appl. 13(3): 826-846 (1992) - [j3]Anita Mayo, Anne Greenbaum:
Fast Parallel Iterative Solution of Poisson's and the Biharmonic Equations on Irregular Regions. SIAM J. Sci. Comput. 13(1): 101-118 (1992) - 1990
- [c1]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:
LAPACK: a portable linear algebra library for high-performance computers. SC 1990: 2-11
1980 – 1989
- 1989
- [j2]Anne Greenbaum:
Synchronization costs on multiprocessors. Parallel Comput. 10(1): 3-14 (1989)
1970 – 1979
- 1979
- [j1]Paul F. Dubois, Anne Greenbaum, Garry H. Rodrigue:
Approximating the inverse of a matrix for use in iterative algorithms on vector processors. Computing 22(3): 257-268 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-04 21:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
