#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1949

2017

- This year (4)
- Last 5 years (21)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Data Set Used

#### Organism

Learn More

- Timothy A. Davis, Yifan Hu
- ACM Trans. Math. Softw.
- 2011

We describe the University of Florida Sparse Matrix Collection, a large and actively growing set of sparse matrices that arise in real applications. The Collection is widely used by the numericalâ€¦ (More)

- Timothy A. Davis
- ACM Trans. Math. Softw.
- 2004

An ANSI C code for sparse LU factorization is presented that combines a column pre-ordering strategy with a right-looking unsymmetric-pattern multifrontal numerical factorization. The pre-orderingâ€¦ (More)

- Yanqing Chen, Timothy A. Davis, William W. Hager, Sivasankaran Rajamanickam
- ACM Trans. Math. Softw.
- 2008

CHOLMOD is a set of routines for factorizing sparse symmetric positive definite matrices of the form <i>A</i> or <i>AA</i><sup>T</sup>, updating/downdating a sparse Cholesky factorization, solvingâ€¦ (More)

- Timothy A. Davis, Ekanathan Palamadai Natarajan
- ACM Trans. Math. Softw.
- 2010

KLU is a software package for solving sparse unsymmetric linear systems of equations that arise in circuit simulation applications. It relies on a permutation to Block Triangular Form (BTF), severalâ€¦ (More)

Sparse matrix factorization algorithms for general problems are typically characterized by irregular memory access patterns that limit their performance on parallel-vector supercomputers. Forâ€¦ (More)

- Timothy A. Davis, John R. Gilbert, Stefan I. Larimore, Esmond G. Ng
- ACM Trans. Math. Softw.
- 2004

Sparse Gaussian elimination with partial pivoting computes the factorization <b>PAQ</b> = <b>LU</b> of a sparse matrix <b>A</b>, where the row ordering <b>P</b> is selected during factorization usingâ€¦ (More)

- Timothy A. Davis
- ACM Trans. Math. Softw.
- 2004

A new method for sparse LU factorization is presented that combines a column pre-ordering strategy with a right-looking unsymmetric-pattern multifrontal numerical factorization. The column orderingâ€¦ (More)

- Patrick Amestoy, Enseeiht-Irit, Timothy A. Davis, Iain S. Duff
- ACM Trans. Math. Softw.
- 2004

AMD is a set of routines that implements the approximate minimum degree ordering algorithm to permute sparse matrices prior to numerical factorization. There are versions written in both C andâ€¦ (More)

- Timothy A. Davis, Iain S. Duff
- ACM Trans. Math. Softw.
- 1999

We discuss the organization of frontal matrices in multifrontal methods for the solution of large sparse sets of unsymmetric linear equations. In the multifrontal method, work on a frontal matrix canâ€¦ (More)

- Timothy A. Davis, William W. Hager
- SIAM J. Matrix Analysis Applications
- 1999

Given a sparse symmetric positive definite matrix AAT and an associated sparse Cholesky factorization LDLT or LLT, we develop sparse techniques for obtaining the new factorization associated withâ€¦ (More)