The following pages link to Timothy A. Davis (Q301688):
Displayed 45 items.
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control (Q301689) (← links)
- A concurrent dynamic task graph (Q1351689) (← links)
- A sparse proximal implementation of the LP dual active set algorithm (Q2465650) (← links)
- Dual multilevel optimization (Q2465655) (← links)
- Multiple-Rank Modifications of a Sparse Cholesky Factorization (Q2706302) (← links)
- (Q2782049) (← links)
- Sparse Matrix Methods for Circuit Simulation Problems (Q2902757) (← links)
- Algorithm 907 (Q2989122) (← links)
- The university of Florida sparse matrix collection (Q2989137) (← links)
- Algorithm 915, SuiteSparseQR (Q2989145) (← links)
- An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization (Q3126194) (← links)
- Algorithm 930 (Q3189692) (← links)
- Algorithm 933 (Q3189700) (← links)
- Direct Methods for Sparse Linear Systems (Q3432847) (← links)
- A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization (Q3497118) (← links)
- Algorithm 849 (Q3507310) (← links)
- MATLAB Primer (Q3579665) (← links)
- Pairwise reduction for the direct, parallel solution of sparse, unsymmetric sets of linear equations (Q3805752) (← links)
- (Q3838213) (← links)
- Modifying a Sparse Cholesky Factorization (Q4243521) (← links)
- (Q4327519) (← links)
- (Q4327524) (← links)
- Finite Element Analysis of the Landau--de Gennes Minimization Problem for Liquid Crystals (Q4389127) (← links)
- A combined unifrontal/multifrontal method for unsymmetric sparse matrices (Q4518199) (← links)
- (Q4527193) (← links)
- Algorithm 980 (Q4581376) (← links)
- (Q4650314) (← links)
- An Approximate Minimum Degree Ordering Algorithm (Q4717298) (← links)
- (Q4860186) (← links)
- Algorithm 1000 (Q4960968) (← links)
- Design and Implementation of a Parallel Markowitz Threshold Algorithm (Q5112242) (← links)
- Algorithm 1003 (Q5132310) (← links)
- Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization (Q5200257) (← links)
- Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work (Q5232110) (← links)
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
- Row Modifications of a Sparse Cholesky Factorization (Q5317616) (← links)
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method (Q5461191) (← links)
- Algorithm 832 (Q5461192) (← links)
- A column approximate minimum degree ordering algorithm (Q5461205) (← links)
- Algorithm 836 (Q5461206) (← links)
- Algorithm 837 (Q5461208) (← links)
- A survey of direct methods for sparse linear systems (Q5740079) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
- Mathematics of Digital Hyperspace (Q6363942) (← links)
- Focusing and Calibration of Large Scale Network Sensors using GraphBLAS Anonymized Hypersparse Matrices (Q6449863) (← links)