References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Davis, Timothy A.; Natarajan, E.Palamadai: Sparse matrix methods for circuit simulation problems (2012)
  2. Langguth, Johannes; Patwary, Md.Mostofa Ali; Manne, Fredrik: Parallel algorithms for bipartite matching problems on distributed memory computers (2011)
  3. Lee, Eun-Joo; Zhang, Jun: A two-phase preconditioning strategy of sparse approximate inverse for indefinite matrices (2009)
  4. Grigori, L.; Cosnard, M.; Ng, E.G.: On the row merge tree for sparse LU factorization with partial pivoting (2007)
  5. Schenk, Olaf; W├Ąchter, Andreas; Hagemann, Michael: Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization (2007)
  6. Lee, Eun-Joo; Zhang, Jun: Hybrid reordering strategies for ILU preconditioning of indefinite sparse matrices (2006)
  7. Hu, Yifan; Scott, Jennifer: Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers. (2005)
  8. Saad, Yousef: Multilevel ILU with reorderings for diagonal dominance (2005)
  9. Duff, I.S.; Koster, J.: On algorithms for permuting large entries to the diagonal of a sparse matrix (2001)
  10. Benzi, Michele; Haws, John C.; Tuma, Miroslav: Preconditioning highly indefinite and nonsymmetric matrices (2000)
  11. Duff, I.S.; Reid, J.K.: The design of MA48: A code for the direct solution of sparse unsymmetric linear systems of equations (1996)
  12. Ng, Esmond G.; Peyton, Barry W.: Some results on structure prediction in sparse QR factorization (1996)
  13. George, Alan; Liu, Joseph; Ng, Esmond: A data structure for sparse QR and LU factorizations (1988)
  14. George, Alan; Ng, Esmond: An implementation of Gaussian elimination with partial pivoting for sparse systems (1985)