A fast Pascal program for the product of large sparse matrices on personal computers

An implementation of a slight variation of the near optimal Gustavson's algorithm (1978) for the product of sparse matrices is given. Special care is devoted to the selection of data structures. The result is an elegant and very fast code specifically tailored for running on personal computers. An analysis is conducted of the X=X*Y problem in order to design the best compact representation for matrices X and Y. The code is briefly described, and test cases are presented. >