Cited in
(29)- On algorithms for permuting large entries to the diagonal of a sparse matrix
- The design of MA48
- A Data Structure for Sparse $QR$ and $LU$ Factorizations
- Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics
- Analysis of a splitting approach for the parallel solution of linear systems on GPU cards
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- On the row merge tree for sparse LU factorization with partial pivoting
- Algorithm 529
- A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices
- Sparse matrix methods for circuit simulation problems
- Givaro
- MA48
- SPIKE
- KLU
- Sparse 1.3
- Xyce
- PSPIKE
- Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices
- COLMOD
- SPQR_RANK
- Algorithm 548
- SaPGPU
- Preconditioning highly indefinite and nonsymmetric matrices
- Parallel algorithms for bipartite matching problems on distributed memory computers
- Multilevel ILU With Reorderings for Diagonal Dominance
- Some Results on Structure Prediction in Sparse $QR$ Factorization
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
This page was built for software: MC21A
