ACM

Communications of the ACM

Home/Magazine Archive/March 1964 (Vol. 7, No. 3)/A class of iterative techniques for the factorization.../Abstract

A class of iterative techniques for the factorization of polynomials

By H. A. Luther
Communications of the ACM, March 1964, Vol. 7 No. 3, Pages 177-179
10.1145/363958.363995
Comments

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

A method of iteration is developed in terms of a function of somewhat arbitrary character. Sufficient conditions are given for convergence of the process, yielding factors of arbitrary degree for polynomials in one variable. Both Lin's method and Newton's method occur as special cases.

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.