No abstract

No abstract

No 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.