A Message-Driven, Multi-GPU Parallel Sparse Triangular Solver N. Ding, Y. Liu, S. Williams, X.S. Li. Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21).
A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs A. Azad, A. Buluc, X.S. Li, X. Wang, and J. Langguth, SIAM J. Sci. Comput., 42(4), C143-C168, 2020.
Highly scalable distributed-memory sparse triangular solution algorithms Y. Liu, M. Jacquelin, P. Ghysels, X.S. Li. Proceedings of the SIAM CSC18, Bergen, Norway. June 6-8, 2018.
A Communication-Avoiding 3D Factorization for Sparse Matrices P. Sao, R. Vuduc, X.S. Li. Proc. IPDPS 2018, Vancourver, May 21-25, 2018.
Comparative Performance Analysis of Coarse Solvers for Algebraic Multigrid on Multicore and Manycore Architectures A. Druinsky, P. Ghysels, X.S. Li, O. Marques, S. Williams, A. Barker, D. Kalchev, and P. Vassilevski. PPAM 2015, Part I, LNCS 9573, pp. 116-127, 2016, Springer.
A Parallel Geometric Multifrontal Solver Using Hierarchically Semiseparable Structure S. Wang, X.S. Li, F.-H. Rouet, J. Xia, M.V. De Hoop, ACM Trans. Math. Software. Vol. 42, No. 3, Article 21:1-21, 2016.
Resilient Matrix Multiplication of Hierarchical Semi-Separable Matrices B. Austin, E. Roman and X.S. Li, Fault Tolerance for HPC at eXtreme Scale (FTXS) Workshop, June 15, 2015. (Best Paper Award)
Factorization-based Sparse Solvers and Preconditioners X.S. Li, 4th Gene Golub SIAM Summer School (Extended Summary), July 22 - Aug. 9, 2013. Chapter in book, "Matrix Functions and Matrix Equations", Z. Bai, W. Gao, Y. Su, editors, Series in Contemporary Applied Mathematics, Oct. 2015.
A Sparse Direct Solver for Distributed Memory Xeon Phi-accelerated Systems P. Sao, X. Liu, R. Vuduc and X.S. Li, 29th IEEE International Parallel \& Distributed Processing Symposium (IPDPS), May 25-29, 2015, Hyderabad, INDIA.
A distributed CPU-GPU sparse direct solver P. Sao, R. Vuduc and X.S. Li, Proc. of Euro-Par 2014 Parallel Processing, LNCS Vol. 8632. Porto, Portugal, August 25-29, 2014.
Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods. Baboulin M., Li X.S., Rouet FH., In: Dayde M., Marques O., Nakajima K. (eds) High Performance Computing for Computational Science -- VECPAR 2014. Lecture Notes in Computer Science, vol 8969. Springer, Cham. https://doi.org/10.1007/978-3-319-17353-5_12
On partitioning and reordering problems in a hierarchically parallel hybrid linear solver (with I. Yamazaki, F.-H. Rouet and B. Ucar), IPDPS 2013, PDSEC Workshop, Boston, May 20-24, 2013.
Efficient scalable algorithms for solving dense linear systems with hierarchically semiseparable structures (with S. Wang, J. Xia, Y. Situ, and M.V. de Hoop), SIAM J. Sci. Comp., 35(6), pp. C519-C544, 2013. (Journal article)
New Scheduling Strategies for a Parallel Right-looking Sparse LU Factorization Algorithm on Multicore Clusters (with I. Yamazaki), IPDPS 2012 Proceedings, pp. 619-630, doi:10.1109/IPDPS.2012.63, Shanghai, May 21-25, 2012.
Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices (with M. Gu and P. Vassilevski). SIAM J. Matrix Anal. Appl., Vol. 31, No. 5, 2650-2664, 2010.
On techniques to improve robustness and scalability of the Schur complement method (with I. Yamazaki), Lecture Notes in Computer Science, Vol.6449, 421-434, 2011. (Proc. of VECPAR 2010, June 22-25, 2010, Berkeley)
Factorization-based sparse solvers and preconditioners (with M. Shao, I. Yamazaki, E. G. Ng), SciDAC 2009, Journal of Physics: Conference Series 180 (2009) 012015.
A Supernodal Approach to Incomplete LU Factorization with Partial Pivoting (with M. Shao), ACM Trans. Math. Software, Vol. 37, No. 4, Article No. 43, April 2011.
Parallel Symbolic Factorization for Sparse LU with Static Pivoting (with L. Grigori and J. Demmel). SIAM J. Sci. Comp., Vol. 29, Issue 3, 1289-1314, 2007.
Fast Algorithms for Hierarchically Semiseparable Matrices (with J. Xia, S. Chandrasekaran, M. Gu), Numer. Linear Algebra Appl., 17:953-976, 2010.
An Implementation and Evaluation of the AMLS Method for Sparse Eigenvalue Problems (with W. Gao, C. Yang and Z. Bai). ACM Trans. Math. Software, Vol. 34, No. 4, July 2008. (Digital Object Identifier DOI)
Diagonal Markowitz Scheme with Local Symmetrization (with P. Amestoy and E. Ng). SIAM J. Matrix Anal. Appl., Vol. 29, No. 1, pp. 228-244, 2007. (Rreport LBNL-53854, December 2003.)
Unsymmetric Ordering Using a Constrained Markowitz Scheme (with P. Amestoy and S. Pralet). SIAM J. Matrix Anal. Appl. Vol. 29, No. 1, pp. 302-327, 2007. (Report LBNL-56861, January 2005.)
An Overview of SuperLU: Algorithms, Implementation, and User Interface. ACM Transactions on Mathematical Software, Vol. 31, No. 3, September 2005, pp. 302-325. (Digital Object Identifier (DOI))
SuperLU_DIST: A Scalable Distributed-memory Sparse Direct Solver for Unsymmetric Linear Systems (with J. Demmel), ACM Transactions on Mathematical Software, Vol. 29, No. 2, June 2003, pp. 110-140. (Digital Object Identifier (DOI)) (Report LBNL-49388, October 2002)
Impact of the Implementation of MPI Point-to-Point Communications on the Performance of Two General Sparse Solvers (with P. Amestoy, I. Duff, J-Y. L'Excellent), Parallel Computing, Vol. 29, Issue 7, July 2003, pp. 833-849.
A New Scheduling Algorithm for Parallel Sparse LU Factorization with Static Pivoting (with L. Grigori), Proceedings of the IEEE/ACM SC2002 Conference, November 16-22, 2002.
Computing Row and Column Counts for Sparse QR and LU Factorization (with J.R. Gilbert, E.G. Ng and B.W. Peyton), BIT Numerical Mathematics, Vol. 41, No. 4, pp. 693-710, December 2001.
Analysis and Comparison of Two General Sparse Solvers for Distributed Memory Computers (with P. Amestoy, I. Duff, J-Y. L'Excellent), ACM Transactions on Mathematical Software, Vol. 27, No. 4, December 2001, pp. 388-421.
(Longer version is Technical report LBNL-45992, July 2000.)
A Scalable Sparse Direct Solver Using Static Pivoting (with J. Demmel), Proceedings of the 9th SIAM Conference on Parallel Processing and Scientific Computing, March 22-24, 1999, San Antonio, Texas.
Making Sparse Gaussian Elimination Scalable by Static Pivoting (with J. Demmel), Proceedings of SC98 Conference, November 7-13, 1998, Orlando, Florida.
More detailed results and the talk can be found here.
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
(with J. W. Demmel and J. R. Gilbert), SIAM J. Matrix Anal. Appl., vol. 20 (4), 915-952, 1999.
A Supernodal Approach to Sparse Partial Pivoting (with J. W. Demmel, S. C. Eisenstat, J. R. Gilbert, and J. W. H. Liu), SIAM J. Matrix Anal. Appl., vol. 20 (3), 720-755, 1999.