The following pages link to MC21A (Q24538):
Displaying 17 items.
- Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711) (← links)
- Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices (Q854442) (← links)
- On the row merge tree for sparse LU factorization with partial pivoting (Q878210) (← links)
- A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices (Q979931) (← links)
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization (Q2643614) (← links)
- On algorithms for permuting large entries to the diagonal of a sparse matrix (Q2706301) (← links)
- Preconditioning highly indefinite and nonsymmetric matrices (Q2706440) (← links)
- Sparse Matrix Methods for Circuit Simulation Problems (Q2902757) (← links)
- A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics (Q2952737) (← links)
- Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers (Q3600008) (← links)
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems (Q3685075) (← links)
- A Data Structure for Sparse $QR$ and $LU$ Factorizations (Q3793608) (← links)
- The design of MA48 (Q4371093) (← links)
- Some Results on Structure Prediction in Sparse $QR$ Factorization (Q4880263) (← links)
- Analysis of a Splitting Approach for the Parallel Solution of Linear Systems on GPU Cards (Q5268983) (← links)
- Multilevel ILU With Reorderings for Diagonal Dominance (Q5470353) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
