Title :
A note on bipartite graphs and pivot selection in sparse matrices
Author :
Sangiovanni-Vincentelli, A.
fDate :
12/1/1976 12:00:00 AM
Abstract :
In this note a bipartite graph representation is proposed for the study of pivot strategies on sparse matrices. Using this representation, an algorithm which fullfills the Brayton´s condition for Gaussian elimination optimality has been devised.
Keywords :
Graph theory; Sparse-matrix methods; Algorithm design and analysis; Bipartite graph; Communication networks; Digital communication; Frequency synchronization; Notice of Violation; Routing; Sparse matrices; Time frequency analysis; Timing;
Journal_Title :
Circuits and Systems, IEEE Transactions on
DOI :
10.1109/TCS.1976.1084160
