Principles for Testing Polynomial Zerofinding Programs

Abstract

The state-of-the-art in polynomial zero finding 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… (More)
DOI: 10.1145/355626.355632

1 Figure or Table

Topics

  • Presentations referencing similar topics