A partial pivoting strategy for sparse symmetric matrix decomposition
- 1 June 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 13 (2) , 173-182
- https://doi.org/10.1145/328512.328525
Abstract
It is well known that the partial pivoting strategy by Bunch and Kaufman is very effective for factoring dense symmetric indefinite matrices using the diagonal pivoting method. In this paper, we study a threshold version of the strategy for sparse symmetric matrix decomposition. The use of this scheme is explored in the multifrontal method of Duff and Reid for sparse indefinite systems. Experimental results show that it is at least as effective as the existing pivoting strategy used in the current multifrontal implementation.Keywords
This publication has 7 references indexed in Scilit:
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983
- Sparse matrix test problemsACM SIGNUM Newsletter, 1982
- LINPACK Users' GuidePublished by Society for Industrial & Applied Mathematics (SIAM) ,1979
- Some stable methods for calculating inertia and solving symmetric linear systemsMathematics of Computation, 1977
- Factorizing symmetric indefinite matricesLinear Algebra and its Applications, 1976
- Direct Methods for Solving Symmetric Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1971
- A frontal solution program for finite element analysisInternational Journal for Numerical Methods in Engineering, 1970