Affiliation:
1. Department of Electrical Engineering, University of Santa Clara, Santa Clara, California
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献