Stanley C. Eisenstat

According to our database1, Stanley C. Eisenstat authored at least 30 papers between 1971 and 2022.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Deflation for the Symmetric Arrowhead and Diagonal-Plus-Rank-One Eigenvalue Problems.
SIAM J. Matrix Anal. Appl., 2022

2017
On the Symmetric Componentwise Relative Backward Error for Linear Systems of Equations.
SIAM J. Matrix Anal. Appl., 2017

2007
Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices.
SIAM J. Matrix Anal. Appl., 2007

O(log* n) algorithms on a Sum-CRCW PRAM.
Computing, 2007

2005
The Theory of Elimination Trees for Sparse Unsymmetric Matrices.
SIAM J. Matrix Anal. Appl., 2005

1999
A Supernodal Approach to Sparse Partial Pivoting.
SIAM J. Matrix Anal. Appl., 1999

1998
Node Selection Strategies for Bottom-Up Sparse Matrix Ordering.
SIAM J. Matrix Anal. Appl., July, 1998

Three Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative Bounds.
SIAM J. Matrix Anal. Appl., 1998

1996
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization.
SIAM J. Sci. Comput., 1996

Choosing the Forcing Terms in an Inexact Newton Method.
SIAM J. Sci. Comput., 1996

1995
Downdating the Singular Value Decomposition.
SIAM J. Matrix Anal. Appl., 1995

A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem.
SIAM J. Matrix Anal. Appl., 1995

A Divide-and-Conquer Algorithm for the Bidiagonal SVD.
SIAM J. Matrix Anal. Appl., 1995

1994
A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem.
SIAM J. Matrix Anal. Appl., October, 1994

Globally Convergent Inexact Newton Methods.
SIAM J. Optim., 1994

1993
Exploiting Structural Symmetry in a Sparse Partial Pivoting Code.
SIAM J. Sci. Comput., 1993

1992
Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization.
SIAM J. Matrix Anal. Appl., 1992

1990
Efficient Polynomial Preconditioning for the Conjugate Gradient Method.
SIAM J. Sci. Comput., 1990

A Fan-In Algorithm for Distributed Sparse Numerical Factorization.
SIAM J. Sci. Comput., 1990

1989
Comments on scheduling parallel iterative methods on multiprocessor systems II.
Parallel Comput., 1989

Comparisons of Three Distributed Algorithms for Sparse Cholesky Factorization.
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing, 1989

1988
An experimental study of methods for parallel preconditioned Krylov methods.
Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, 1988

1984
Squeezing the most out of an algorithm in CRAY FORTRAN.
ACM Trans. Math. Softw., 1984

1980
Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem.
J. ACM, 1980

1978
Preserving Average Proximity in Arrays.
Commun. ACM, 1978

1976
Can structured programs be efficient?
ACM SIGPLAN Notices, 1976

Space and Time Hierarchies for Classes of Control Structures and Data Structures.
J. ACM, 1976

1975
The Complexity of Control Structures and Data Structures
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

Efficient implementation of sparse nonsymmetric Gaussian elimination without pivoting.
Proceedings of the SIGNUM Meeting on Software for Partial Differential Equations, 1975

1971
The Mathematical Programming Language (MPL).
Proceedings of the 26th ACM annual conference, 1971


  Loading...