My research interests are in the development and application of high performance linear algebra algorithms. Currently I am investigating the use of techniques based on singular value decomposition and eigenvalue analysis to applications in information retrieval, web link analysis, and clustering. At NERSC I was also leading the project on "Sparse Linear Algebra Algorithms for MPPs", which resulted in scalable implementation of the Lanczos algorithm, approximate inverse preconditioners, and dynamic partitioning. My continued areas of interest are sparse matrix algorithms, algorithms for large scale eigenvalue problems, and domain decomposition algorithms for unstructured domains for parallel processing. My algorithm research efforts were honored with the 1988 Gordon Bell Prize for parallel processing research. Software based on my "recursive spectral bisection algorithm" has been widely distributed to the finite element research community, and is regarded a major breakthrough in parallel algorithms for unstructured computations.