A variant of Snay’s algorithm

This paper presents a variant of Snay’s algorithm for profile reduction of matrices. The new heuristic for profile reduction shows better results when compared with the results of several reordering algorithms with regards to reducing the computational cost of the zero-fill incomplete Cholesky-preconditioned conjugate gradient method applied to small linear systems arising from a computational fluid dynamics problem.