A few publications are listed. The attached resume has a complete list.

- "Algorithm 933: Reliable Calculation of Numerical Rank, Null Space Bases, Pseudoinverse Solutions and Basic Solutions using SuiteSparseQR," by Leslie V. Foster and Timothy A. Davis, ACM Transactions on Mathematical Software, Vol 40, Article 7, September, 2013. Code implementing the algorithm is part of SuiteSparse.
- "New Approaches to Photometric Redshift Prediction via Gaussian Process Regression in the Sloan Digital Sky Survey," The Astrophysical Journal, 706:623--636, 2009. Coauthors: Michael Way, Paul Gazis, Ashok Srivastava.
- "Stable and Efficient Gaussian Process Calculations," Journal of Machine Learning Research 10: 857-882, 2009, coauthored with Alex Waagen, Nabeela Aijaz, Michael Hurley, Apolonio Luis, Joel Rinsky and Chandrika Satyavolu, Michael Way, Paul Gazis, and Ashok Srivastava. Software discussed in the paper is in the file stableGP.zip and stableGP_license.txt is a BSD license for the software.
- "Algorithm 853:An Efficient Algorithm for Solving Rank-Deficient Least Squares Problems," by Leslie Foster and Rajesh Kommu, ACM Transactions on Mathematical Software, 32, pp. 157-165, 2006. The file xgelsz.tar.gz contains the code discussed in this paper. The file is in compressed format. To uncompress the file in Unix use "gunzip xgelsz.tar.gz" and "tar xf xgelsz.tar". In Windows use a tool such as Winzip or PowerDesk.
- "Solving Rank-Deficient and Ill-posed Problems using UTV and QR Factorizations," SIAM J. Matrix Anal. Appl. 25, pp. 582-600, 2004.
- "The growth factor and efficiency of Gaussian elimination with rook pivoting," J. Comput. Appl. Math. 86, pp. 177-194, 1997. A preprint, which includes the correction in the note below, is included here.
- "Corrigendum: The growth factor and efficiency of Gaussian elimination with rook pivoting," J. Comput. Appl. Math. 98, p. 177, 1998.
- "Gaussian elimination with partial pivoting can fail in practice," SIAM J. Matrix Anal. Appl., vol. 15, 1354-1362, 1994. A preprint is included here. Also available is a Matlab m file, gfpp.m, which generates the examples from this paper and related papers. The paper illustrates matrices that lead to large growth factors with a population growth problem and a solution mixture problem. The examples appear to be problems that could naturally arise in practical applications. We should note, as mentioned in the paper, that the problems and the approach to solving the problems were carefully selected.
- "Modifications of the normal equations method that are numerical stable," published in Numerical Linear Algebra, Digital Signal Processing and Parallel Algorithms, G. H. Golub and P. Van Dooren editors, Springer-Verlag, Berlin, pp. 501-512, 1991. A preprint is included here.
- "Rank and Null Space Calculations using Matrix Decomposition without Column Interchanges," Linear Algebra and its Applications, Vol. 74, pp. 47-71, 1986.
- "Generalizations of Laguerre's Method: Lower Order Methods," an unpublished manuscript that has been cited in the literature including in SIAM J. Sci. Comput. 17 (1996) 1347--1368, Math. Comp. 66 (1997) 345--361, Numer. Math. 82 (1999) 491--519, and Amer. Math. Monthly 113 (2006), no. 9, 794--804.

Talks. Here are links to four talks. See the attached resume for a list of talks.

- "Reliable Calculation of Numerical Rank, Null Space Bases, Basic Solutions and Pseudoinverse Solutions using SuiteSparseQR" presented at the 2011 Householder Conference (Householder XVIII), Lake Tahoe, CA, June 15, 2011.
- "Calculating ranks, null spaces and pseudoinverse solutions for sparse matrices using SPQR" presented at the 2009 SIAM Conference on Applied Linear Algebra (SIAM LA09) in Monterey, CA, October 28, 2009.
- "Row Echelon Form is (usually) Accurate After All" given at the Internation Linear Algebra Society Annual Conference, Shanghai, China, July 17, 2007.
- "Why the QR factorization can be more accurate than the SVD" given at the Stanford SCCM Seminar on May 10, 2004 and at the SIAM National Meeting in Portland, OR on July 15, 2004.