publication venue for
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization. 48:1-23. 2022
- Algorithm 1003: Mongoose, a Graph Coarsening and Partitioning Library. 1-18. 2020
- Algorithm 1000: SuiteSparse:GraphBLAS: Graph Algorithms in the Language of Sparse Linear Algebra. 1-25. 2019
- Solution of Dense Linear Systems via Roundoff-Error-Free Factorization Algorithms: Theoretical Connections and Computational Comparisons. 44:40-24. 2018
- Algorithm 980: Sparse QR Factorization on the GPU. 1-29. 2017
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem. 1-25. 2016
- Algorithm 933: Reliable Calculation of Numerical Rank, Null Space Bases, Pseudoinverse Solutions, and Basic Solutions using SuiteSparseQR. 7-23. 2013
- Algorithm 921: alphaCertified: Certifying Solutions to Polynomial Systems. 28-20. 2012
- An Empirical Analysis of the Performance of Preconditioners for SPD Systems. 38:24-30. 2012
- Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems. 36-17. 2010
- Dynamic Supernodes in Sparse Cholesky Update/Downdate and Triangular Solves. 27-23. 2009
- Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate. 22-14. 2008
- Algorithm 832: UMFPACK V4.3 - An unsymmetric-pattern multifrontal method. 196-199. 2004
- Algorithm 837: AMD, an approximate minimum degree ordering algorithm. 30:381-388. 2004
- Compression of particle data from hierarchical approximate methods. 27:317-339. 2001
- A column approximate minimum degree ordering algorithm. 353-376.
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method. 165-195.
- A combined unifrontal multifrontal method for unsymmetric sparse matrices. 25:1-20.
- Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. 30:377-380.
- The University of Florida Sparse Matrix Collection. 1-25.
- Algorithm 849: A concise sparse Cholesky factorization package