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

DOI10.1137/0911053MaRDI QIDQ3497117zbMATH OpenOpenAlexFDO

Authors

Publication date 1990

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0911053

zbMATH Keywords

Gaussian eliminationin-core factorization of sparse matricesiterative refinementlinear programming

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
• scientific article; zbMATH DE number 4117735
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Evaluation of Orderings for Unsymmetric Sparse Matrices
• An out-of-core sparse symmetric-indefinite factorization method

Cited in

(3)

• A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
• A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
• A survey of direct methods for sparse linear systems

This page was built for publication: Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3497117)