Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse Matrices
Authors:
- M. ArioliMAM. Arioli
- I. S. DuffIDI. S. Duff
- N. I. M. GouldNGN. I. M. Gould
- J. K. ReidJRJ. K. Reid
- 1 September 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 11 (5) , 913-927
Abstract
Variants of the ${\text{P}}^4 $ algorithm of Hellerman and Rarick and the ${\text{P}}^5 $ algorithm of Erisman, Grimes, Lewis, and Poole, used for generating a bordered block triangular form for the in-core solution of sparse sets of linear equations, are considered.A particular concern is with maintaining numerical stability. Methods for ensuring stability and the extra cost that they entail are discussed.Different factorization schemes are also examined. The uses of matrix modification and iterative refinement are considered, and the best variant is compared with an established code for the solution of unsymmetric sparse sets of linear equations. The established code is usually found to be the most effective method.
Keywords
This publication has 9 references indexed in Scilit:
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Evaluation of Orderings for Unsymmetric Sparse MatricesSIAM Journal on Scientific and Statistical Computing, 1987
- A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse MatricesSIAM Journal on Numerical Analysis, 1985
- Some Design Features of a Sparse Matrix CodeACM 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.1976
- On Block Elimination for Sparse Linear SystemsSIAM Journal on Numerical Analysis, 1974
- The Partitioned Preassigned Pivot Procedure (P4)1972
- Reinversion with the preassigned pivot procedureMathematical Programming, 1971
- The Elimination form of the Inverse and its Application to Linear ProgrammingManagement Science, 1957