ACM

Communications of the ACM

Home/Magazine Archive/January 1967 (Vol. 10, No. 1)/An improvement to iterative methods of polynomial.../Abstract

An improvement to iterative methods of polynomial factorization

By John A. C. Bingham
Communications of the ACM, January 1967, Vol. 10 No. 1, Pages 57-60
10.1145/363018.363063
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

Methods of polynomial factorization which find the zeros one at a time require the division of the polynomial by the accepted factor. It is shown how the accuracy of this division may be increased by dividing in order of both ascending and descending powers of the variable and choosing a crossover point which minimizes a very simply calculated error criterion.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.