Xiaoye Sherry Li   

Staff Computer Scientist
Computational Research Division
Lawrence Berkeley National Laboratory
MS 50F-1650.
One Cyclotron Rd, Berkeley, CA 94720
Computer Science Division
Univ. of California, Berkeley
email: xsli (at) lbl (dot) gov
Tel: 510-486-6684  
Fax: 510-486-5812

Research interests:

Sparse matrix computations
High performance computing
Design and optimization of algorithms on parallel machines
Numerical linear algebra

I do research and provide support for mathematical software on the parallel machines at NERSC. Currently, I am heavily involved in the DOE TOPS and NSF NPACI projects.
I received Ph.D. in Computer Science from UC Berkeley.

Li's Google Scholar Citations

Selected papers:(Full list)

Sparse matrix computations
Floating-point, high-precision arithmetic
Performance evaluation
Numerical optimization


SuperLU -- Sequential and parallel libraries to solve unsymmetric sparse linear systems using LU factorization.
PDSLin -- Parallel Domain-decomposition, Schur complement based hybrid sparse linear solver.
XBLAS -- A reference implementation for the Extended and Mixed precision BLAS standard.
ARPREC -- A C++/F90 package for performing arbitrary precision arithmetic.
CLAPACK -- Full set of LAPACK in C.
ieee_except -- A set of condition estimation routines, which are faster than those in LAPACK, by utilizing floating-point exception handling. It contains routines to manipulate IEEE exception sticky flags.

Selected presentations:

Invited Lecturer, short course on Factorization-based sparse solvers and preconditioners, 4th Gene Golub SIAM Summer School, July 22-Aug. 9, 2013, Shanghai. (Videos and course materials)
Towards an optimal-order approximate sparse factorization exploiting data-sparseness in separators, Invited Speaker, Workshop Celebrating 40 Years of Nested Dissection, July 22-23, 2013, Waterloo.
Factorization-based sparse solvers and preconditioners, Invited Plenary Lecture, SIAM Annual Meeting, July 12-16, 2010. (view presentation)
Towards an Optimal Parallel Approximate Factorization Using HSS Structures, Householder Symposium XVIII, June 13-17, 2011, Tahoe City, California.
A Supernodal Approach for ILU with Partial Pivoting, Sparse Days 2010 (Invited), CERFACS, June 15-17, 2010
Sparse matrix methods on high performance computers, Invited Lecture, CS267/Eng233, UCB, March 16, 2010.
Use of Semi-separable Approximate Factorization and Direction-preserving for Constructing Effective Preconditioners , SIAM Conference on Applied Linear Algebra, Monterey Bay-Seaside, Oct. 26-29, 2009.
Performance Modeling Tools for Parallel Sparse Linear Algebra Computations, ParCo 2009, September 1-4, 2009, ENS-Lyon, France.
Scalability Issues in Sparse Factorization and Triangular Solution, Sparse Days, June 23-24, 2008, CERFACS, Toulouse, France.
Evaluation of sparse LU factorization and triangular solution on multicore architectures, VECPAR 2008, June 24-27, 2008, Toulouse, France.
Algebraic Sub-structuring for Large-scale Electromagnetic Application, 16th International Conference on Domain Decomposition Methods, January 12-15, 2005, Courant Institute, New York University.
A Comparison of Three High-Precision Quadrature Schemes, Experimental Math Workshop, March 29-30, 2004. Oakland, CA.
Fill Reduction Algorithm Using Diagonal Markowitz Scheme with Local Symmetrization, SIAM Conference on Computational Science and Engineering, February 10-13, 2003, San Diego.

Selected professional services:

Associate Editor, ACM Trans. Math. Software (2006-present)
Associate Editor, SIAM J. Scientific Computing (2006-2009)