Abstract Partitioning a sparse matrix A is a useful device employed by a number of sparse matrix techniques. An important problem that arises in connection with some of these methods is to determine the block structure of the Cholesky factor L of A, given the partitioned A. For the scalar case, the problem of determining the structure of L from A, so-called symbolic factorization, has been extensively studied. In this paper we study the generalization of this problem to the block case. The problem is interesting because an assumption relied on in the scalar case no longer holds; specifically, the product of two nonzero scalars is always nonzero, but the product of two nonnull sparse matrices may yield a zero matrix. Thus, applying the usual symbolic factorization techniques to a partitioned matrix, regarding each submatrix as a scalar, may yield a block structure of L which is too full. In this paper an efficient algorithm is provided for determining the block structure of the Cholesky factor of a partitioned matrix A, along with some bounds on the execution time of the algorithm.
[1]
Alfred V. Aho,et al.
The Design and Analysis of Computer Algorithms
,
1974
.
[2]
Robert E. Tarjan,et al.
Algorithmic Aspects of Vertex Elimination on Graphs
,
1976,
SIAM J. Comput..
[3]
William G. Poole,et al.
Incomplete Nested Dissection for Solving n by n Grid Problems
,
1978
.
[4]
A. George,et al.
A Minimal Storage Implementation of the Minimum Degree Algorithm
,
1980
.
[5]
Andrew Harry Sherman,et al.
On the efficient solution of sparse systems of linear and nonlinear equations.
,
1975
.
[6]
J. Pasciak,et al.
Computer solution of large sparse positive definite systems
,
1982
.
[7]
Alan George,et al.
An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices
,
1980,
SIAM J. Comput..
[8]
S. Parter.
The Use of Linear Graphs in Gauss Elimination
,
1961
.