Reordering a sparse matrix to a sparse blocked form
Copyright policy )Reordering a sparse matrix to a sparse blocked form
Throughout the analysis of LSI and VLSI circuits, one must deal with very large sets of sparse linear equations. In solving such sets of equations, a significant saving in computational effort can be obtained if the structure of the system matrix is considered. In this paper we present an algorithm which reorders a sparse matrix to a sparse blocked form. We note that nested cellular arrays can be used in solving equations with such blocked coefficient matrices.
- King Saud University Saudi Arabia
- Syracuse University United States
Computational methods for sparse matrices, Graphs and linear algebra (matrices, eigenvalues, etc.), bipartite graph, Other matrix algorithms, sparse blocked form, LSI circuits, reordering a sparse matrix, VLSI circuits, computational effort, reordering algorithm
Computational methods for sparse matrices, Graphs and linear algebra (matrices, eigenvalues, etc.), bipartite graph, Other matrix algorithms, sparse blocked form, LSI circuits, reordering a sparse matrix, VLSI circuits, computational effort, reordering algorithm
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!