A parallel wilf algorithm for complex zeros of a polynomial |
| |
| Authors: | E. V. Krishnamurthy H. Venkateswaran |
| |
| Affiliation: | (1) Present address: Department of Computer Science, The University of Tennessee, 37916 Knoxville, Tennesse, USA;(2) Indian Institute of Science, 560012 Bangalore, India |
| |
| Abstract: | A global recursive bisection algorithm is described for computing the complex zeros of a polynomial. It has complexityO(n3p) wheren is the degree of the polynomial andp the bit precision requirement. Ifn processors are available, it can be realized in parallel with complexityO(n2p); also it can be implemented using exact arithmetic. A combined Wilf-Hansen algorithm is suggested for reduction in complexity. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
