Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse Matrices

This publication has 9 references indexed in Scilit:

• Sparse matrix test problems
  ACM Transactions on Mathematical Software, 1989
• Evaluation of Orderings for Unsymmetric Sparse Matrices
  SIAM Journal on Scientific and Statistical Computing, 1987
• A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
  SIAM Journal on Numerical Analysis, 1985
• Some Design Features of a Sparse Matrix Code
  ACM Transactions on Mathematical Software, 1979
• A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING††Research for this paper was supported by the Energy Research and Development Administration Contract AT(04-3)-326 PA #18, at Stanford University.
  Published by Elsevier ,1976
• On Block Elimination for Sparse Linear Systems
  SIAM Journal on Numerical Analysis, 1974
• The Partitioned Preassigned Pivot Procedure (P4)
  Published by Springer Nature ,1972
• Reinversion with the preassigned pivot procedure
  Mathematical Programming, 1971
• The Elimination form of the Inverse and its Application to Linear Programming
  Management Science, 1957