Accession Number:

AD0784426

Title:

Principles for Testing Polynomial Zerofinding Programs,

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1974-03-01

Pagination or Media Count:

28.0

Abstract:

The state-of-the-art in polynomial zerofinding algorithms and programs is briefly summarized. Our focus in this paper is on principles for testing such programs. We view testing as requiring four steps 1 testing program robustness, 2 testing for convergence difficulties, 3 testing for specific weakness of the algorithms, 4 assessment of program performance by statistical testing. The authors algorithm for real polynomials has been reprogrammed with substantial modifications to the decision making processes. In order to verify that the new program is a reliable and efficient mathematical software product, it underwent the testing outlined above. The results of part of this testing are described in this paper. Modified author abstract

Subject Categories:

  • Theoretical Mathematics
  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE