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

DOI10.1137/0911053zbMath0711.65015OpenAlexW2162033099MaRDI QIDQ3497117

No author found.

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

linear programmingGaussian eliminationiterative refinementin-core factorization of sparse matrices

Mathematics Subject Classification ID

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

Related Items (2)

A locally optimized reordering algorithm and its application to a parallel sparse linear system solver ⋮ 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