Stanley C. Eisenstat - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2022

Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue ProblemsJesse L. Barlow, Stanley C. Eisenstat, Nevena Jakovcevic Stor, Ivan Slapnicar. siammax, 43(2):681-709, 2022. [doi]

2017

On the Symmetric Componentwise Relative Backward Error for Linear Systems of EquationsStanley C. Eisenstat, Serge Gratton, David Titley-Péloquin. siammax, 38(4):1100-1115, 2017. [doi]

2007

Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric MatricesStanley C. Eisenstat, Joseph W. H. Liu. siammax, 29(4):1363-1381, 2007. [doi]

O(log* n) algorithms on a Sum-CRCW PRAMStanley C. Eisenstat. computing, 79(1):93-97, 2007. [doi]

2005

The Theory of Elimination Trees for Sparse Unsymmetric MatricesStanley C. Eisenstat, Joseph W. H. Liu. siammax, 26(3):686-705, 2005. [doi]

1999

A Supernodal Approach to Sparse Partial PivotingJames Weldon Demmel, Stanley C. Eisenstat, John R. Gilbert, Xiaoye S. Li, Joseph W. H. Liu. siammax, 20(3):720-755, 1999. [doi]

1998

Three Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative BoundsStanley C. Eisenstat, Ilse C. F. Ipsen. siammax, 20(1):149-158, 1998. [doi]

Node Selection Strategies for Bottom-Up Sparse Matrix OrderingEdward Rothberg, Stanley C. Eisenstat. siammax, 19(3):682-695, July 1998. [doi]

1996

Choosing the Forcing Terms in an Inexact Newton MethodStanley C. Eisenstat, Homer F. Walker. siamsc, 17(1):16-32, 1996. [doi]

Efficient Algorithms for Computing a Strong Rank-Revealing QR FactorizationMing Gu, Stanley C. Eisenstat. siamsc, 17(4):848-869, 1996. [doi]

1995

A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal EigenproblemMing Gu, Stanley C. Eisenstat. siammax, 16(1):172-191, 1995. [doi]

Downdating the Singular Value DecompositionMing Gu, Stanley C. Eisenstat. siammax, 16(3):793-810, 1995. [doi]

A Divide-and-Conquer Algorithm for the Bidiagonal SVDMing Gu, Stanley C. Eisenstat. siammax, 16(1):79-92, 1995. [doi]

1994

A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric EigenproblemMing Gu 0002, Stanley C. Eisenstat. siammax, 15(4):1266-1276, October 1994. [doi]

Globally Convergent Inexact Newton MethodsStanley C. Eisenstat, Homer F. Walker. siamjo, 4(2):393-422, 1994. [doi]

1993

Exploiting Structural Symmetry in a Sparse Partial Pivoting CodeStanley C. Eisenstat, Joseph W. H. Liu. siamsc, 14(1):253-257, 1993. [doi]

1992

Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic FactorizationStanley C. Eisenstat, Joseph W. H. Liu. siammax, 13(1):202-211, 1992. [doi]

1990

A Fan-In Algorithm for Distributed Sparse Numerical FactorizationCleve Ashcraft, Stanley C. Eisenstat, Joseph W. H. Liu. siamsc, 11(3):593-599, 1990. [doi]

Efficient Polynomial Preconditioning for the Conjugate Gradient MethodStanley C. Eisenstat, James M. Ortega, Courtenay T. Vaughan. siamsc, 11(5):859-872, 1990. [doi]

1989

Comparisons of Three Distributed Algorithms for Sparse Cholesky FactorizationC. Ashcraft, Stanley C. Eisenstat, J. Liu, Andrew H. Sherman. ppsc 1990: 55-56

Comments on scheduling parallel iterative methods on multiprocessor systems IIStanley C. Eisenstat. pc, 11(2):241-244, 1989.

1988

An experimental study of methods for parallel preconditioned Krylov methodsDoug Baxter, Joel H. Saltz, Martin H. Schultz, Stanley C. Eisenstat, Kay Crowley. c3p 1988: 1698-1711 [doi]

1984

Squeezing the most out of an algorithm in CRAY FORTRANJack Dongarra, Stanley C. Eisenstat. TOMS, 10(3):219-230, 1984. [doi]

1980

Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding TheoremRichard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton. JACM, 27(1):123-127, 1980. [doi]

1978

Preserving Average Proximity in ArraysRichard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton. CACM, 21(3):218-231, 1978.

1976

Can structured programs be efficient?Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton. SIGPLAN, 11(10):10-18, 1976. [doi]

Space and Time Hierarchies for Classes of Control Structures and Data StructuresRichard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo. JACM, 23(4):720-732, 1976. [doi]

1975

Efficient implementation of sparse nonsymmetric Gaussian elimination without pivotingStanley C. Eisenstat, Andrew H. Sherman. signum 1975: 26-29 [doi]

The Complexity of Control Structures and Data StructuresRichard J. Lipton, Stanley C. Eisenstat, Richard A. DeMillo. stoc 1975: 186-193

1971

The Mathematical Programming Language (MPL)George B. Dantzig, Stanley C. Eisenstat, Thomas L. Magnanti, Steven F. Maier, Michael B. McGrath. acm 1971: 278-283 [doi]

Sign in or sign up to see more results.

runs on WebDSL