default search action
Stanley C. Eisenstat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j25]Jesse L. Barlow, Stanley C. Eisenstat, Nevena Jakovcevic Stor
, Ivan Slapnicar
Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems. SIAM J. Matrix Anal. Appl. 43(2): 681-709 (2022)
2010 – 2019
- 2017
- [j24]Stanley C. Eisenstat, Serge Gratton, David Titley-Péloquin:
On the Symmetric Componentwise Relative Backward Error for Linear Systems of Equations. SIAM J. Matrix Anal. Appl. 38(4): 1100-1115 (2017)
2000 – 2009
- 2007
- [j23]Stanley C. Eisenstat:
O(log* n) algorithms on a Sum-CRCW PRAM. Computing 79(1): 93-97 (2007) - [j22]Stanley C. Eisenstat, Joseph W. H. Liu:
Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Anal. Appl. 29(4): 1363-1381 (2007) - 2005
- [j21]Stanley C. Eisenstat, Joseph W. H. Liu:
The Theory of Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Anal. Appl. 26(3): 686-705 (2005)
1990 – 1999
- 1999
- [j20]James Weldon Demmel, Stanley C. Eisenstat, John R. Gilbert, Xiaoye S. Li, Joseph W. H. Liu:
A Supernodal Approach to Sparse Partial Pivoting. SIAM J. Matrix Anal. Appl. 20(3): 720-755 (1999) - 1998
- [j19]Edward Rothberg, Stanley C. Eisenstat:
Node Selection Strategies for Bottom-Up Sparse Matrix Ordering. SIAM J. Matrix Anal. Appl. 19(3): 682-695 (1998) - [j18]Stanley C. Eisenstat, Ilse C. F. Ipsen
Three Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative Bounds. SIAM J. Matrix Anal. Appl. 20(1): 149-158 (1998) - 1996
- [j17]Stanley C. Eisenstat, Homer F. Walker:
Choosing the Forcing Terms in an Inexact Newton Method. SIAM J. Sci. Comput. 17(1): 16-32 (1996) - [j16]Ming Gu, Stanley C. Eisenstat:
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization. SIAM J. Sci. Comput. 17(4): 848-869 (1996) - 1995
- [j15]Ming Gu, Stanley C. Eisenstat:
A Divide-and-Conquer Algorithm for the Bidiagonal SVD. SIAM J. Matrix Anal. Appl. 16(1): 79-92 (1995) - [j14]Ming Gu, Stanley C. Eisenstat:
A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem. SIAM J. Matrix Anal. Appl. 16(1): 172-191 (1995) - [j13]Ming Gu, Stanley C. Eisenstat:
Downdating the Singular Value Decomposition. SIAM J. Matrix Anal. Appl. 16(3): 793-810 (1995) - 1994
- [j12]Stanley C. Eisenstat, Homer F. Walker:
Globally Convergent Inexact Newton Methods. SIAM J. Optim. 4(2): 393-422 (1994) - [j11]Ming Gu, Stanley C. Eisenstat:
A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem. SIAM J. Matrix Anal. Appl. 15(4): 1266-1276 (1994) - 1993
- [j10]Stanley C. Eisenstat, Joseph W. H. Liu:
Exploiting Structural Symmetry in a Sparse Partial Pivoting Code. SIAM J. Sci. Comput. 14(1): 253-257 (1993) - 1992
- [j9]Stanley C. Eisenstat, Joseph W. H. Liu:
Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization. SIAM J. Matrix Anal. Appl. 13(1): 202-211 (1992) - 1990
- [j8]Cleve Ashcraft, Stanley C. Eisenstat, Joseph W. H. Liu:
A Fan-In Algorithm for Distributed Sparse Numerical Factorization. SIAM J. Sci. Comput. 11(3): 593-599 (1990) - [j7]Stanley C. Eisenstat, James M. Ortega, Courtenay T. Vaughan:
Efficient Polynomial Preconditioning for the Conjugate Gradient Method. SIAM J. Sci. Comput. 11(5): 859-872 (1990)
1980 – 1989
- 1989
- [j6]Stanley C. Eisenstat:
Comments on scheduling parallel iterative methods on multiprocessor systems II. Parallel Comput. 11(2): 241-244 (1989) - [c5]Cleve Ashcraft, Stanley C. Eisenstat, Joseph W. H. Liu, Andrew H. Sherman:
Comparisons of Three Distributed Algorithms for Sparse Cholesky Factorization. PP 1989: 55-56 - 1988
- [c4]Doug Baxter, Joel H. Saltz, Martin H. Schultz, Stanley C. Eisenstat, Kay Crowley:
An experimental study of methods for parallel preconditioned Krylov methods. C³P 1988: 1698-1711 - 1984
- [j5]Jack J. Dongarra, Stanley C. Eisenstat:
Squeezing the most out of an algorithm in CRAY FORTRAN. ACM Trans. Math. Softw. 10(3): 219-230 (1984) - 1980
- [j4]Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton:
Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem. J. ACM 27(1): 123-127 (1980)
1970 – 1979
- 1978
- [j3]Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton:
Preserving Average Proximity in Arrays. Commun. ACM 21(3): 218-231 (1978) - 1976
- [j2]Richard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo:
Space and Time Hierarchies for Classes of Control Structures and Data Structures. J. ACM 23(4): 720-732 (1976) - [j1]Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton:
Can structured programs be efficient? ACM SIGPLAN Notices 11(10): 10-18 (1976) - 1975
- [c3]Stanley C. Eisenstat, Andrew H. Sherman:
Efficient implementation of sparse nonsymmetric Gaussian elimination without pivoting. SIGNUM 1975: 26-29 - [c2]Richard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo:
The Complexity of Control Structures and Data Structures. STOC 1975: 186-193 - 1971
- [c1]George B. Dantzig, Stanley C. Eisenstat, Thomas L. Magnanti, Steven F. Maier, Michael B. McGrath:
The Mathematical Programming Language (MPL). ACM Annual Conference 1971: 278-283
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-07-04 21:29 CEST 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: