Bipartite network associated with optimal pivoting problem

摘要

AbstractThe 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 ne