arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.04171cs.DS
收藏

RCM++:基于双准则节点查找器的反向Cuthill-McKee排序

RCM++:Reverse Cuthill-McKee ordering with Bi-Criteria Node Finder

JiaJun Hou, HongJie Liu, ShengXin Zhu

AI总结:

本文提出RCM++算法,通过双准则(偏心率和宽度)选择起始节点,改进反向Cuthill-McKee排序,在相当计算时间内获得更高质量结果,优于现有方法。

摘要:

反向Cuthill-McKee(RCM)算法是一种基于图的方法,用于对稀疏矩阵进行重排序,以其在最小化矩阵带宽和轮廓方面的有效性而闻名。这种重排序提高了矩阵运算的效率,使RCM在重排序算法中占据关键地位。在执行RCM算法的过程中,通常需要从矩阵的图表示中选择一个起始节点。这一选择允许执行BFS(广度优先搜索)来构建层级结构。起始节点的选择对算法性能有显著影响,因此需要一种启发式方法来识别最优起始节点,这通常被称为RCM起始节点问题。最小度方法和George-Liu(GL)算法是常用的解决方案。本文提出了一种新算法,通过同时考虑运行过程中节点的偏心率和宽度来解决RCM起始节点问题。将该算法与RCM算法集成,我们引入了RCM++。实验结果表明,RCM++在主要软件库中优于现有的RCM方法,在相当的计算时间内实现了更高质量的结果。这一进展促进了RCM算法的进一步应用和发展。本研究的代码已在https://github.com/SStan1/RCM_PP.git上公开。

英文摘要:

The Reverse Cuthill-McKee (RCM) algorithm is a graph-based method for reordering sparse matrices, renowned for its effectiveness in minimizing matrix bandwidth and profile. This reordering enhances the efficiency of matrix operations, making RCM pivotal among reordering algorithms. In the context of executing the RCM algorithm, it is often necessary to select a starting node from the graph representation of the matrix. This selection allows the execution of BFS (Breadth-First Search) to construct the level structure. The choice of this starting node significantly impacts the algorithm's performance, necessitating a heuristic approach to identify an optimal starting node, commonly referred to as the RCM starting node problem. Techniques such as the minimum degree method and George-Liu (GL) algorithm are popular solutions. This paper introduces a novel algorithm addressing the RCM starting node problem by considering both the eccentricity and the width of the node during the run. Integrating this algorithm with the RCM algorithm, we introduce RCM++. Experimental results demonstrate that RCM++ outperforms existing RCM methods in major software libraries, achieving higher quality results with comparable computation time. This advancement fosters the further application and development of the RCM algorithm.The code related to this research has been made available at https://github.com/SStan1/RCM\_PP.git.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑