Sparse Low-Rank Approximations to Sparse MatricesG. W. (Pete) Stewart
Information Technology Laboratory, Mathematical and Computational Sciences Division; and University of Maryland, Department of Computer Science
Wednesday, October 12, 2005 15:00-16:00,
Speaker Bio: G. W. (Pete) Stewart received his degree in Mathematics in 1968 under the late Alston Householder. He has held academic positions at the University of Texas and Carnegie Mellon University. He is currently Full Professor in the Computer Science Department and is a permanent member of the Institute for Advanced Computer Studies at the University of Maryland, College Park. He is the author of over 125 journal articles on various aspects of numerical analysis and matrix computation, with applications in statistical computing, signal processing, and stochastic processes. His books include Introduction to Matrix Computation, Matrix Perturbation Theory (with J. G. Sun), Afternotes on Numerical Analysis, and Matrix Algorithms I and II--a survey of matrix computations. He is a coauthor of the LINPACK package for linear algebra. In 1999 he was awarded the Bauer Prize by the Technical University of Munich. He is a member of the National Academy of Engineering.
Contact: P. M. Ketcham
Note: Visitors from outside NIST must contact Robin Bickel; (301) 975-3668; at least 24 hours in advance.