Abstract
We describe a test method by which a program for polynomial equations can be examined with its specification about the input parameters and the output information. The test is systematically performed under desired conditions, and gives a practical criterion of a judgement on the reliability of the program.
Zusammenfassung
Wir beschreiben eine Testmethode, bei der ein Programm für algebraische Gleichungen durch eine Spezifikation von Eingangsparameter und Ausgangsinformation untersucht werden kann. Der Test wird unter selbstgewählten Bedingungen systematisch ausgeführt und liefert praktische Kriterien zur Beurteilung der Zuverlässigkeit des Programms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Wilkinson, J. H.: Rounding errors in algebraic processes, pp. 25–26. Englewood Cliffs, N. J.: Prentice-Hall 1963.
Henrici, P.: Elements of numerical analysis, pp. 99–101, pp. 305–309. New York: J. Wiley 1964.
Henrici, P.: Applied and computational complex analysis, Vol. 1, p. 442. New York: J. Wiley 1974.
Ohnaka, K.: A deterministic evaluation method for the roots of polynomial equations. Joho-Shori19, 26–31 (1978). (In Japanese.)
Miel, G.: On a posteriori error estimates. Math. Comp.31, 204–213 (1977).
Henrici, P., Watkins, B. O.: Finding zeros of a polynomial by the theQ-D algorithm. Comm. ACM8, 570–574 (1965).
Rall, L. B.: Convergence of the Newton process to multiple solutions. Numer. Math.9, 23–37 (1966).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ohnaka, K., Isomoto, Y. & Makinouchi, S. On a test of programs for numerical zeros of polynomials. Computing 25, 163–174 (1980). https://doi.org/10.1007/BF02259642
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02259642