Stanley Eisenstat

Professor of Computer Science
B.S., Case Institute of Technology, 1966
M.S., Ph.D., Stanford University, 1967, 1972
Joined Yale Faculty 1971

Eisenstat's major research interests include numerical linear and nonlinear algebra, direct and iterative methods for solving sparse linear systems, and parallel computing.

He serves as an associate editor of the Journal of the ACM.

Representative Publications

An Efficient Algorithm for Computing a Strong Rank-Revealing QR Factorization", with Ming Gu, SIAM Journal on Scientific Computing, 17(4):848-869, July 1996.
Globally convergent inexact Newton methods", with Homer F. Walker, SIAM Journal on Optimization 4(2):393-422, May 1994.
Relative perturbation techniques for singular value problems", with Ilse C. F. Ipsen, SIAM Journal on Numerical Analysis 32(5):1972-1988, October 199

Return to Academic and Research Faculty: Stanley Eisenstat