Reordering a sparse matrix to a sparse blocked form

DOI10.1002/CTA.4490130206MaRDI QIDQ3700690zbMATH OpenOpenAlexFDO

Authors Mohammed A. Alturaigi, Theodore A. Bickart

Publication date 1985

Published in International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/cta.4490130206

zbMATH Keywords

bipartite graphcomputational effortLSI circuitsreordering a sparse matrixreordering algorithmsparse blocked formVLSI circuits

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50)

Recommendations

• scientific article; zbMATH DE number 4117735
• On the ordering of sparse linear systems
• scientific article; zbMATH DE number 3898113
• Direct methods for solving large sparse systems of equations based on the two by two block decomposition of the matrix
• A locally optimized reordering algorithm and its application to a parallel sparse linear system solver

Cites work

• Graph theory with applications

Cited in

(3)

• Block rearranging elements within matrix columns to minimize the variability of the row sums
• Computing the block triangular form of a sparse matrix
• Permuting Sparse Rectangular Matrices into Block-Diagonal Form

This page was built for publication: Reordering a sparse matrix to a sparse blocked form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3700690)