Home → Magazine Archive → December 1960 (Vol. 3, No. 12) → On programming the numerical solution of polynomial... → Abstract

On programming the numerical solution of polynomial equations

By Kenneth W. Ellenberger

Communications of the ACM, Vol. 3 No. 12, Pages 644-647

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.

The full text of this article is premium content


No entries found