The Hellerman-Rarick (HR) algorithm is a heuristic routine that assigns pivot elements and spikes so as to minimize the number of columns with nonzeros above the diagonal. A detailed description of the algorithm is given in Hellerman and Rarick. In this paper, the authors focus attention on the implementation. Two alternatives are presented : one that reduces storage space as much as possible, and the other which concentrates on fast execution while...
Voir la suite
INFORMATION
-
1979/03/31
-
Document de travail (série numérotée)
-
DRC10
-
1
-
1
-
2020/06/13
-
Disclosed
-
Time - space tradeoff in the implementation of the Hellerman-Rarick algorithm
-
initial value