Algorithms for reducing the bandwidth and profile of a sparse matrix

DOI10.1016/0045-7949(92)90386-EzbMath0781.65035OpenAlexW2023235205MaRDI QIDQ4039501

No author found.

Publication date: 13 June 1993

Published in: Computers & Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7949(92)90386-e

zbMATH Keywords

algorithmbandwidth reductionNP-complete problemlevel structuressparse symmetric matrixprofile reductionenvelope reduction

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Related Items

Heuristics for matrix bandwidth reduction ⋮ GRASP and path relinking for the matrix bandwidth minimization. ⋮ A constructive bandwidth reduction algorithm -- a variant of GPS algorithm ⋮ Profile minimization on compositions of graphs ⋮ Processor-efficient sparse matrix-vector multiplication ⋮ Profile minimization on products of graphs ⋮ Reducing the bandwidth of a sparse matrix with tabu search. ⋮ On the profile of the corona of two graphs ⋮ A review on the application of fuzzy transform in data and image compression

This page was built for publication: Algorithms for reducing the bandwidth and profile of a sparse matrix