Premium
Bipartite network associated with optimal pivoting problem
Author(s) -
Shirakawa Isao,
Kyan Seiki,
Ozaki Hiroshi
Publication year - 1975
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490030107
Subject(s) - bipartite graph , prime (order theory) , matrix (chemical analysis) , computer science , coefficient matrix , mathematics , algorithm , mathematical optimization , theoretical computer science , combinatorics , graph , eigenvalues and eigenvectors , materials science , physics , quantum mechanics , composite material
The coefficient matrix of a fairly large system of equations is generally very sparse. Thus in the computer‐aided analysis of such a system of equations, of prime importance are the sparsity‐oriented solution and storage techniques. Motivated by this problem, in the present paper we first define a bipartite network associated with a given system of equations, and then discuss the problem of sparsity‐preserving pivot ordering with the use of the bipartite network.