Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
- 1 January 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 13 (1), 202-211
- https://doi.org/10.1137/0613017
Abstract
This paper shows how to exploit structural symmetry in determining the nonzero structures of the lower and upper triangular factors L and U of an unsymmetric sparse matrix A. Two symmetric reductions of the graphs of L and U are introduced and used to formulate symbolic factorization algorithms. Experimental results demonstrate the effectiveness of these algorithms versus other schemes in the literature.Keywords
This publication has 6 references indexed in Scilit:
- The Role of Elimination Trees in Sparse FactorizationSIAM Journal on Matrix Analysis and Applications, 1990
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- Sparse Partial Pivoting in Time Proportional to Arithmetic OperationsSIAM Journal on Scientific and Statistical Computing, 1988
- A New Implementation of Sparse Gaussian EliminationACM Transactions on Mathematical Software, 1982
- Algorithmic Aspects of Vertex Elimination on Directed GraphsSIAM Journal on Applied Mathematics, 1978
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972