On programming the numerical solution of polynomial equations

  • Authors:

  • Kenneth W. Ellenberger

  • Affiliations:

  • North American Aviation, Inc., Downey, CA

  • Venue:
  • Communications of the ACM
  • Year:
  • 1960

Quantified Score

Hi-index 48.22

Visualization

Abstract

Numerical techniques are presented for computing the roots of polynomial equations. By applying the recommended scaling and inversion rules, the basic Bistrow and Newton-Raphson iterative techniques can be applied with great reliability. Both a high degree of accuracy and rapid convergence are realized. Numerical examples are shown to illustrate the pitfalls and to show how these are circumvented by application of the recomended procedures.