Prof. Tim Davis Classes: Fall 2008: COT 4501, Numerical Analysis - a Computational Approach. Spring 2008: COP 3530 - Data Structures and Algorithms, and class resource page. About me: Chair, College of Engineering Faculty Council Background Horror matrices and other Mathematical poetry Serious poetry Research: Sparse matrix algorithms SIAM News: Sparse Matrix Algorithm Drives SPICE Performance Gains Summary of available software for sparse direct methods CERFACS 20th Anniversary Meeting, Toulouse, France, October 11-12, 2007. Click here for photos of our time at CERFACS in 1989-1990. Contact: Tim Davis, Professor, CISE Department, E301 CSE Building, P.O. Box 116120, University of Florida, Gainesville, FL 32611-6120. phone (352) 392-1481, fax (352) 392-1220, email: my last name AT cise.ufl.edu

University of Florida Sparse Matrix Collection

MATLAB Primer, 7th edition

Direct Methods for Sparse Linear Systems

Recent talks :

• Direct Methods for Sparse Linear Systems: the MATLAB sparse backslash, an invited Plenary Talk at the SIAM Annual Meeting, Boston, 2006.

Current students:

• Siva Rajamanickam, PhD student. Project: sparse SVD.
• Yanqing (Morris) Chen, PhD student. Project: parallel update/downdate.
• Pawan Aurora, MS student. Project: quadratic-programming based graph partitioning.

Books:

• Direct Methods for Sparse Linear Systems, T. A. Davis, SIAM, Philadelphia, Sept. 2006. Part of the SIAM Book Series on the Fundamentals of Algorithms.
• MATLAB Primer, 7th edition T. A. Davis and K. Sigmon, CRC Press, 2004.
• MATLAB Primer, 6th edition K. Sigmon and T. A. Davis, CRC Press, 2001.

Journal articles (full list):

• Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization L. Grigori, E. Boman, S. Donfack, and T. A. Davis, Submitted to SIAM Journal on Scientific Computing (SISC). (as CISE Tech Report)
• The University of Florida Sparse Matrix Collection T. A. Davis, Submitted to SIAM Journal on Matrix Analysis and Applications. (as CISE Tech Report)
• Dynamic supernodes in sparse Cholesky update/downdate and triangular solves, T. A. Davis and W. W. Hager, TR-2006-004. ACM Trans. Math. Software (to appear). (as CISE Tech Report)
• Algorithm 8xx: CHOLMOD, supernodal sparse Cholesky factorization and update/downdate , Y. Chen, T. A. Davis, W. W. Hager, and S. Rajamanickam, TR-2006-005. Trans. Math. Software (to appear). (as CISE Tech Report)
• Quadratic programming techniques in graph partitioning, S. C. Park, T. A. Davis, W. W. Hager, H. Zhang, submitted to SIAM J. Sci. Computing, 2006. (as CISE Tech Report)
• Dual multilevel optimization, T. A. Davis and W. W. Hager, Mathematical Programming, published online, 2006. To appear in print. (also as tech report) (as CISE Tech Report)
• A sparse proximal implementation of the LP Dual Active Set Algorithm, T. A. Davis and W. W. Hager, Mathematical Programming, published online, 2006. To appear in print. (also as tech report). (as CISE Tech Report)
• Algorithm 849: A concise sparse Cholesky factorization package, T. A. Davis, ACM Transactions on Mathematical Software, vol 31, no. 4, Dec. 2005, pp. 587-591. (as CISE Tech Report)
• Model representation with aesthetic computing: method and empirical study, P. Fishwick, J. Douglas, and T. A. Davis, ACM Transactions on Modeling and Computer Simulation, vol 15, no 3, July 2005, pp. 254-279.
• Row modifications of a sparse Cholesky factorization, T. A. Davis and W. W. Hager, SIAM Journal on Matrix Analysis and Applications, vol 26, no 3, pp. 621-639, 2005. (as CISE Tech Report)
• A column approximate minimum degree ordering algorithm, T. A. Davis, J. R. Gilbert, S. Larimore, E. Ng, ACM Transactions on Mathematical Software, vol 30, no. 3, Sept. 2004, pp. 353-376. (as CISE Tech Report)
• Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm T. A. Davis, J. R. Gilbert, S. Larimore, E. Ng, ACM Transactions on Mathematical Software, vol 30, no. 3, Sept. 2004, pp. 377-380. (as CISE Tech Report)
• Algorithm 837: AMD, An approximate minimum degree ordering algorithm, P. Amestoy, T. A. Davis, and I. S. Duff, ACM Transactions on Mathematical Software, vol 30, no. 3, Sept. 2004, pp. 381-388. (as CISE Tech Report)
• A column pre-ordering strategy for the unsymmetric-pattern multifrontal method, T. A. Davis, ACM Transactions on Mathematical Software, vol 30, no. 2, June 2004, pp. 165-195. (as CISE Tech Report)
• Algorithm 832: UMFPACK, an unsymmetric-pattern multifrontal method, T. A. Davis, ACM Transactions on Mathematical Software, vol 30, no. 2, June 2004, pp. 196-199. (as CISE Tech Report)
• Multiple-rank modifications of a sparse Cholesky factorization, T. A. Davis and W. W. Hager, SIAM Journal on Matrix Analysis and Applications, vol. 22, no. 4, pp. 997-1013, 2001. (as CISE Tech Report)
• Modifying a sparse Cholesky factorization, T. A. Davis and W. W. Hager, SIAM Journal on Matrix Analysis and Applications, vol. 20, no. 3, pp. 606-627, 1999. (as CISE Tech Report)
• A combined unifrontal/multifrontal method for unsymmetric sparse matrices, T. A. Davis and I. S. Duff, ACM Transactions on Mathematical Software, vol. 25, no. 1, pp. 1-19, March 1999. (as CISE Tech Report)
• An unsymmetric-pattern multifrontal method for sparse LU factorization, T. A. Davis and I. S. Duff, SIAM Journal on Matrix Analysis and Applications, vol 18, no. 1, pp. 140-158, Jan. 1997. (as CISE Tech Report)
• An approximate minimum degree ordering algorithm, P. Amestoy, T. A. Davis, and I. S. Duff, SIAM Journal on Matrix Analysis and Applications, vol 17, no. 4, pp. 886-905, Dec. 1996. (as CISE Tech Report)
• A concurrent dynamic task graph, T. Johnson, T. A. Davis, and S. M. Hadfield, Parallel Computing, vol. 22, no. 2, pp. 327-333, Feb. 1996.
• Multifrontal vs. frontal techniques for chemical process simulation on supercomputers, S. E. Zitney, J. Mallya, T. A. Davis, and M. A. Stadtherr, J. Computers and Chemical Engineering, vol 20, No 6/7, pp. 641-646, 1996. (as CISE Tech Report)
• The use of graph theory in a parallel multifrontal method for sequences of unsymmetric pattern sparse matrices, S. M. Hadfield and T. A. Davis, Congressus Numerantium, vol. 108, pp. 43-52, 1995. (as CISE Tech Report)
• Parallel buddy memory management, T. Johnson and T. A. Davis, Parallel Processing Letters, vol. 2, no. 4, pp. 391-398, 1992. (as CISE Tech Report)
• A nondeterministic parallel algorithm for general unsymmetric sparse LU factorization, T. A. Davis and P.-C. Yew, SIAM Journal on Matrix Analysis and Applications, vol. 11, no. 3, pp. 383-402, 1990.
• Pairwise reduction for the direct, parallel solution of sparse unsymmetric sets of linear equations, T. A. Davis and E. S. Davidson, IEEE Transactions on Computers, vol. 37, no. 12, pp. 1648-1654, 1988.

• Creating sparse finite-element matrices in MATLAB, guest blog in Loren on the Art of MATLAB, March 1st, 2007, http://blogs.mathworks.com/loren/.
• KLU: a "Clark Kent" sparse LU factorization algorithm for circuit matrices, a talk given by Ken Stanley at the 2004 SIAM Conference on Parallel Processing for Scientific Computing (PP04).
• CISE Technical reports. You can see a complete list of my technical reports by searching by author.