Motivation for the choice of order of elimination in dealing with sparse symmetric matrices is provided by consideration of a network analogue and then generalized to asymmetric matrices.
Get full access to this article
View all access options for this article.
References
1.
BunchJ. R.RoseD. J., Sparse Matrix Computations. Academic Press Inc. (1976).
2.
BramellerA.AllanR. N.HamamY. M., Sparsity. Pitman (1976).
3.
MullineuxN.ReedJ. R., ‘Diakoptics in node-to-datum analysis’, Proc. I.E.E., 121(7), pp. 639–644 (1974).
4.
BryantP. R., “The algebra and topology of electrical networks”, Proc. I.E.E., 108C, pp. 215–229 (1961).
5.
LePageW. R.SeelyS., General Network Analysis, McGraw-Hill (1952).
