Sparse matrix test problems

ABSTRACT

The development, analysis and production of algorithms in sparse linear algebra often requires the use of test problems to demonstrate the effectiveness and applicability of the algorithms. Many algorithms have been developed in the context of specific application areas and have been tested in the context of sets of test problems collected by the developers. Comparisons of algorithms across application areas and comparisons between algorithms has often been incomplete, due to the lack of a comprehensive set of test problems. Additionally we believe that a comprehensive set of test problems will lead to a better understanding of the range of structures in sparse matrix problems and thence to better classification and development of algorithms. We have agreed to sponsor and maintain a general library of sparse matrix test problems, available on request to anyone for a nominal fee to cover postal charges. Contributors to the library will, of course, receive a free copy.

REFERENCES

• 1: G. Everstine, "A comparison of three resequencing algorithms for the reduction of matrix profile and wavefront", Int. J. for Num. Meth. in Eng. 14, 1979, pp 837--853.
• 2: Alan George , Joseph W. Liu, Computer Solution of Large Sparse Positive Definite, Prentice Hall Professional Technical Reference, 1981