Software Performance Evaluation Papers in TOMS, Volumes 1-15
John R. Rice · Purdue e-Pubs (Purdue University System) · 1990
This report contains: 1) A list of 45 papers in the Association of Computing Machinery Transactions on Mathematical Software (TOMS) which consider the performance evaluation of software, either in general or for specific classes of applications.2) The abstract and list of references for each of these papers.Some papers from Volume 16 (1990) are included but this list is not complete as the complete contents of this volume is not yet known.* TItis report is part of lJJe project on numerical software perfonnance evaluation sponsored by IFZP WG2.5 (Working Group on Nwnerical Software). Vol. 1Principles for Testing Polynomial-Zerofinding Programs.M.A. Jenkins and J.F. Traub.26-34.The srate of the art in polynomial zerofinding algorithms and programs is briefly summarized, with emphasis on the principles for testing such programs.The authors view testing as requiring four stages: (1) testing program.robus01ess, (2) testing for convergence difficulties.(3) testing for specific weakness of the algorithms, (4) assessment of program performance by statistical testing.It is emphasized that the statistical testing must be done with care.There are many ways to generate "random" polynomials.but two classes of random polynomials which have been widely used are of only limited usefulness in terms of evaluating reliability or performance because they produce polynomials with very similar characlerisrics.Classes of random polynomials which should be used are discussed.A Comparison of Three Algorithms for Linear Zero-One Programs, A. Mahendrarajah and F. Fiala.331-334.Three algorithms for the linear zero~one programming problem, Algorithms 341 and 449 of Communications of lhe ACM and Lawler and Bell's algorirhm, are compared and computational experience is summarized.Numerical Comparisons of Explicit Runge-Kulla Pairs of Orders Four through Eight, P.W. Sharp.