An evaluation of low-cost heuristics for matrix bandwidth and profile reductions

Hundreds of heuristics have been proposed to resolve the problems of bandwidth and profile reductions since the 1960s. We found 132 heuristics that have been applied to these problems in reviews of the literature. Among them, 14 were selected for which no other simulation or comparison revealed that the heuristic could be superseded by any other algorithm in the analyzed articles with respect to bandwidth or profile reduction. We also considered the computational costs of the heuristics during this process. Therefore, these 14 heuristics were selected as potentially being the best low-cost methods to solve the bandwidth and/or profile reduction problems. Results of the 14 selected heuristics are evaluated in this work. For evaluation on the set of test problems, a metric based on the relative percentage distance to the best possible bandwidth or profile is proposed. The most promising heuristics for several application areas are identified. Moreover, it was found that the FNCHC and GPS heuristics showed the best overall results in reducing the bandwidth of symmetric and asymmetric matrices among the evaluated heuristics, respectively. In addition, the NSloan and MPG heuristics showed the best overall results in reducing the profile of symmetric and asymmetric matrices among the heuristics among the evaluated heuristics, respectively.

[1]  Joel H. Saltz,et al.  ICASE Report No . 92-12 / iVG / / ff 3 J / ICASE THE DESIGN AND IMPLEMENTATION OF A PARALLEL UNSTRUCTURED EULER SOLVER USING SOFTWARE PRIMITIVES , 2022 .

[2]  José Torres-Jiménez,et al.  An improved simulated annealing algorithm for bandwidth minimization , 2008, Eur. J. Oper. Res..

[3]  Fred W. Glover,et al.  Reducing the bandwidth of a sparse matrix with tabu search , 2001, Eur. J. Oper. Res..

[4]  Isaac Plana,et al.  GRASP and path relinking for the matrix bandwidth minimization , 2004, Eur. J. Oper. Res..

[5]  C. Lanczos.  Solution of Systems of Linear Equations by Minimized Iterations1 , 1952 .

[6]  Dragan Urosevic,et al.  Variable neighbourhood search for bandwidth reduction , 2008, Eur. J. Oper. Res..

[7]  John G. Lewis.  Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms , 1982, TOMS.

[8]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[9]  Carlos A. Felippa,et al.  Solution of linear equations with skyline-stored symmetric matrix , 1975 .

[10]  R. Snay.  Reducing the profile of sparse symmetric matrices , 1976 .

[11]  Ian Burgess,et al.  A new node renumbering algorithm for bandwidth reduction , 1986 .

[12]  Alan George,et al.  An Implementation of a Pseudoperipheral Node Finder , 1979, TOMS.

[13]  Jennifer A. Scott,et al.  Reducing the Total Bandwidth of a Sparse Unsymmetric Matrix , 2006, SIAM J. Matrix Anal. Appl..

[14]  Sanderson L. Gonzaga de Oliveira,et al.  Metaheuristic-based Heuristics for Symmetric-matrix Bandwidth Reduction: A Systematic Review , 2015, ICCS.

[15]  I. Duff,et al.  The effect of ordering on preconditioned conjugate gradients , 1989 .

[16]  John Reid,et al.  Ordering symmetric sparse matrices for small profile and wavefront , 1999 .

[17]  Michele Benzi,et al.  Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems , 1999, SIAM J. Sci. Comput..

[18]  Elizabeth Cuthill,et al.  Several Strategies for Reducing the Bandwidth of Matrices , 1972 .

[19]  Christos H. Papadimitriou,et al.  The NP-Completeness of the bandwidth minimization problem , 1976, Computing.

[20]  J. A. George.  Computer implementation of the finite element method , 1971 .

[21]  Luciano Tarricone,et al.  A new matrix bandwidth reduction algorithm , 1998, Oper. Res. Lett..

[22]  Raghu Kacker,et al.  A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs , 2015, Inf. Sci..

[23]  Yuan Jinjiang,et al.  Profile minimization problem for matrices and graphs , 1994 .

[24]  Paulo M. Pimenta,et al.  AN ALGORITHM FOR PROFILE AND WAVEFRONT REDUCTION OF SPARSE MATRICES WITH A SYMMETRIC STRUCTURE , 1993 .

[25]  Michael B. Giles,et al.  Renumbering unstructured grids to improve the performance of codes on hierarchical memory machines , 1997 .

[26]  Andrew Lim,et al.  A centroid-based approach to solve the bandwidth minimization problem , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[27]  Qing Wang,et al.  A Generalized GPS Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix , 2009 .

[28]  ANDREW LIM,et al.  A Fast Algorithm for Bandwidth Minimization , 2007, Int. J. Artif. Intell. Tools.

[29]  Ali Kaveh,et al.  ORDERING FOR BANDWIDTH AND PROFILE MINIMIZATION PROBLEMS VIA CHARGED SYSTEM SEARCH ALGORITHM , 2012 .

[30]  Ian P. King,et al.  An automatic reordering scheme for simultaneous equations derived from network systems , 1970 .

[31]  M. Benzi.  Preconditioning techniques for large linear systems: a survey , 2002 .

[32]  Gordon C. Everstine,et al.  A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront , 1979 .

[33]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[34]  Scott W. Sloan,et al.  A FORTRAN program for profile and wavefront reduction , 1989 .

[35]  Steven J. Fenves,et al.  A two‐step approach to finite element ordering , 1983 .

[36]  Jennifer A. Scott,et al.  A Multilevel Algorithm for Wavefront Reduction , 2001, SIAM J. Sci. Comput..

[37]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[38]  Andrew Lim,et al.  A New Node Centroid Algorithm for Bandwidth Minimization , 2003, IJCAI.

[39]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

[40]  Norman E. Gibbs,et al.  A Comparison of Several Bandwidth and Profile Reduction Algorithms , 1976, TOMS.

[41]  John G. Lewis,et al.  Sparse matrix test problems , 1982, SGNM.

[42]  Riccardo Poli,et al.  A Hyper-Heuristic Approach to Evolving Algorithms for Bandwidth Reduction Based on Genetic Programming , 2011, SGAI Conf..

[43]  A. Pothen,et al.  Two improved algorithms for envelope and wavefront reduction , 1997 .

[44]  William G. Poole,et al.  An algorithm for reducing the bandwidth and profile of a sparse matrix , 1976 .

[45]  Jinjiang Yuan,et al.  Profile minimization problem for matrices and graphs , 1994 .