The use of the reverse Cuthill-McKee method with an alternative pseudo-peripheral vertice finder for profile optimization

Abstract

Abstract. The need to determine pseudo-peripheral vertices arises from several methods for ordering sparse matrix equations. This paper evaluates an alternative algorithm for finding such vertices based on the Kaveh-Bondarabady algorithm. Specifically, this paper evaluates a variation of this algorithm against the original algorithm and the George-Liu algorithm. Extensive experiments among these algorithms in conjunction with the reverse Cuthill-McKee method suggest that the modified algorithm is a suitable alternative for reducing profile of symmetric matrices.

An Experimental Analysis of Three Pseudo-peripheral Vertex Finders in conjunction with the Reverse Cuthill-McKee Method for Bandwidth Reduction

“…This paper analizes experimentally the George-Liu [10] and Kaveh-Bondarabady [19] algorithms for finding pseudoperipheral vertices along with a modified Kaveh-Bondarabady algorithm when applied in conjunction with the Reverse Cuthill-McKee method [11] for bandwidth reductions of matrices. This work is a revised and expanded version of a paper presented at the XXXVII Brazilian National Congress in Applied and Computational Mathematics (CNMAC 2017) [13].…”