Algorithms for reducing the bandwidth and profile of a sparse matrix

From MaRDI portal





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.











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)