A Convergent Algorithm for Solving Polynomial Algorithms
- 1 April 1967
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 14 (2) , 311-315
- https://doi.org/10.1145/321386.321393
Abstract
The method of steepest descent is applied in a convergent procedure to determine the zeros of polynomials having either real or complex coefficients. By expressing the polynomials in terms of the Siljak functions, the methods are readily programmed on a digital computer. The significance of the procedures is that their application is straightforward, and not only is convergence rapid in the region of a zero but convergence is guaranteed independent of the initial values.Keywords
This publication has 3 references indexed in Scilit:
- Automatic Analog Solution of Algebraic Equations and Plotting of Root Loci by Generalized Mitrovic MethodIEEE Transactions on Applications and Industry, 1964
- Solution of Algebraic and Transcendental Equations on an Automatic Digital ComputerJournal of the ACM, 1959
- 1957 IRE National Convention RecordProceedings of the IRE, 1957