Algorithms for reducing the bandwidth and profile of a sparse matrix
The paper deals with an algorithm to reduce the bandwidth of a sparse symmetric matrix. As this is an NP-complete problem, all practical methods are of a heuristic nature. Like many such algorithms, also this one starts with a level structure on the graph associated with the matrix, and then finds two end points of a pseudo-diameter. The level sets are subsequently decomposed into connected components, which are then even further subdivided, to arrive at a new and more refined level structure. There are some examples to show the application of the procedure. Unfortunately, the algorithm is no good for reducing the profile or envelope of a matrix, which may be more important, as pure bandwidth solvers are hardly used any more.
- Algorithms for the reduction of matrix bandwidth and profile
- scientific article; zbMATH DE number 4090692
- scientific article; zbMATH DE number 4037041
- Bandwidth reduction in sparse matrices
- A comparison of algorithms for profile reduction of sparse matrices
- An algorithm for profile and wavefront reduction of sparse matrices
- Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix
- A Linear Time Implementation of Profile Reduction Algorithms for Sparse Matrices
- A comparison of three algorithms for reducing the profile of a sparse matrix
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
- On the profile of the corona of two graphs
- Algorithms for the reduction of matrix bandwidth and profile
- GRASP and path relinking for the matrix bandwidth minimization.
- Processor-efficient sparse matrix-vector multiplication
- Profile minimization on compositions of graphs
- Profile minimization on products of graphs
- Simple heuristic algorithm for profile reduction of arbitrary sparse matrix
- Bandwidth reduction in sparse matrices
- The bandwidths of a matrix. A survey of algorithms
- A hybrid algorithm for reducing matrix bandwidth
- An algorithm for profile and wavefront reduction of sparse matrices
- scientific article; zbMATH DE number 3980373 (Why is no real title available?)
- scientific article; zbMATH DE number 4037041 (Why is no real title available?)
- scientific article; zbMATH DE number 4090692 (Why is no real title available?)
- A comparison of three algorithms for reducing the profile of a sparse matrix
- scientific article; zbMATH DE number 1114254 (Why is no real title available?)
- Algorithm 807
- A constructive bandwidth reduction algorithm -- a variant of GPS algorithm
- Reducing the bandwidth of a sparse matrix with tabu search.
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions
- A review on the application of fuzzy transform in data and image compression
- Heuristics for matrix bandwidth reduction
This page was built for publication: Algorithms for reducing the bandwidth and profile of a sparse matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4039501)