Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T18:03:17.268Z Has data issue: false hasContentIssue false

An algorithm for the total, or partial, factorization of a polynomial

Published online by Cambridge University Press:  24 October 2008

M. R. Farmer
Affiliation:
Department of Computer Science, Birkbeck College, London
G. Loizou
Affiliation:
Department of Computer Science, Birkbeck College, London
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A globally convergent algorithm is presented for the total, or partial, factorization of a polynomial. Firstly, a circle is found containing all the zeros. Secondly, a search procedure locates smaller circles, each containing a zero, and the multiplicities are then calculated. Thirdly, a simultaneous Iteration Function is used to accelerate convergence. The Iteration Function is chosen from a class of such functions derived herein to deal with the general case of multiple zeros; various properties of these functions are also discussed. Finally, sample numerical results are given which demon-strate the effectiveness of the algorithm.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1977