Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Sparse matrix test problems

Sparse matrix test problems SPARSE MATRIX TEST PROBLEMS laln Duff, Roger Grimes, John Lewis and Bill Poole 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. Duff has maintained a collection of test problems, started by Curtis and Reid, at Harwell for several years, and this collection has been available to researchers. The sparse matrix group at BCS has also collected sparse problems from different areas than those in the Harwell collection, and they have been included informally in Duff's collection. By combining forces we hope to broaden the scope of the current separate collections, thereby making possible a general library of test problems. We are hereby soliciting from our readers sparse matrices which will improve this library. Our interests are: sparse linear algebraic systems, both symmetric and unsymmetrlc; sparse algebraic eigenvalue problems; sparse linear least squares problems and bases from linear progr~mmlng problems. Our principal goal is to include more problems which are interesting by virtue of their origin in some new or unusual applicatlon, their sparslty structure, or unusual numerical properties. We hope to obtain representative problems from many disciplines, for: I. Linear Equations symmetric positive definite symmetric indefinite symmetric structured unsymmetrlc Eigenvalue Problems symmetric generalized symmetric general Linear Least Squares Linear Progr-mm~ng Bases. Problems will be maintained in the common format which is now in use at Harwell. This is a general format which can be directly useful in many applications. The format allows us to represent any sparse matrix whose structure (and numerical values) can be given explicitly. We also accept and request problems from finiteelement applications which are available in unassembled, element-wise, form. The current collections which will be the nucleus of the library include a small number of test matrices from linear progr~mmlng problems, electrical circuit and electric power transmission networks, structural engineering analyses of buildings and aircraft, chemical flow processes, oceanography, atmospheric pollution studies and general chemical kinetics, atomic physics eigenproblems, econometrics, stochastic methods in computing science, statistics, and surveying. There are also several small matrices which are counterexamples for various ordering strategies. In addition, the library includes the structures of the test collections used by Everstine [I] and George & Liu [2]. If you have used or encountered sparse matrix problems which would extend or reinforce the coverage of this library, please write to one of the coordinators below to obtain information on tape formats which can be accepted by our respective computer installations. The coordinators are: Europe, Asia, Africa laln S. Duff AERE Harwell CSS Division, Building 8.9 Didcot, Oxon, OXII ORA ENGLAND The Americas and Australia John G. Lewis Boeing Computer Services Co. Mall Stop 9C-01 PO Box 24346 Seattle, WA 98124 The contents of the initial version of the library of sparse matrices will announced in the SlGNUM and IMANA newsletters. We hope to have initial information on the library available at the Sparse Matrix Symposium, Fairfield Glade, Tennessee, in October, 1982. II. III. IV. [i] 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] A. George and J. Liu, Computer Solution of Large Positive Definite Systems, Prentice-Hall, 1981. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGNUM Newsletter Association for Computing Machinery

Sparse matrix test problems

Loading next page...
 
/lp/association-for-computing-machinery/sparse-matrix-test-problems-VoVCPF00Wx

References (8)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1982 by ACM Inc.
ISSN
0163-5778
DOI
10.1145/1057588.1057590
Publisher site
See Article on Publisher Site

Abstract

SPARSE MATRIX TEST PROBLEMS laln Duff, Roger Grimes, John Lewis and Bill Poole 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. Duff has maintained a collection of test problems, started by Curtis and Reid, at Harwell for several years, and this collection has been available to researchers. The sparse matrix group at BCS has also collected sparse problems from different areas than those in the Harwell collection, and they have been included informally in Duff's collection. By combining forces we hope to broaden the scope of the current separate collections, thereby making possible a general library of test problems. We are hereby soliciting from our readers sparse matrices which will improve this library. Our interests are: sparse linear algebraic systems, both symmetric and unsymmetrlc; sparse algebraic eigenvalue problems; sparse linear least squares problems and bases from linear progr~mmlng problems. Our principal goal is to include more problems which are interesting by virtue of their origin in some new or unusual applicatlon, their sparslty structure, or unusual numerical properties. We hope to obtain representative problems from many disciplines, for: I. Linear Equations symmetric positive definite symmetric indefinite symmetric structured unsymmetrlc Eigenvalue Problems symmetric generalized symmetric general Linear Least Squares Linear Progr-mm~ng Bases. Problems will be maintained in the common format which is now in use at Harwell. This is a general format which can be directly useful in many applications. The format allows us to represent any sparse matrix whose structure (and numerical values) can be given explicitly. We also accept and request problems from finiteelement applications which are available in unassembled, element-wise, form. The current collections which will be the nucleus of the library include a small number of test matrices from linear progr~mmlng problems, electrical circuit and electric power transmission networks, structural engineering analyses of buildings and aircraft, chemical flow processes, oceanography, atmospheric pollution studies and general chemical kinetics, atomic physics eigenproblems, econometrics, stochastic methods in computing science, statistics, and surveying. There are also several small matrices which are counterexamples for various ordering strategies. In addition, the library includes the structures of the test collections used by Everstine [I] and George & Liu [2]. If you have used or encountered sparse matrix problems which would extend or reinforce the coverage of this library, please write to one of the coordinators below to obtain information on tape formats which can be accepted by our respective computer installations. The coordinators are: Europe, Asia, Africa laln S. Duff AERE Harwell CSS Division, Building 8.9 Didcot, Oxon, OXII ORA ENGLAND The Americas and Australia John G. Lewis Boeing Computer Services Co. Mall Stop 9C-01 PO Box 24346 Seattle, WA 98124 The contents of the initial version of the library of sparse matrices will announced in the SlGNUM and IMANA newsletters. We hope to have initial information on the library available at the Sparse Matrix Symposium, Fairfield Glade, Tennessee, in October, 1982. II. III. IV. [i] 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] A. George and J. Liu, Computer Solution of Large Positive Definite Systems, Prentice-Hall, 1981.

Journal

ACM SIGNUM NewsletterAssociation for Computing Machinery

Published: Jun 1, 1982

There are no references for this article.