DocumentCode
1177059
Title
A note on bipartite graphs and pivot selection in sparse matrices
Author
Sangiovanni-Vincentelli, A.
Volume
23
Issue
12
fYear
1976
fDate
12/1/1976 12:00:00 AM
Firstpage
817
Lastpage
821
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;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1976.1084160
Filename
1084160
Link To Document