Krishnamurthy, E. V. ; Venkateswaran, H. (1981) A parallel wilf algorithm for complex zeros of a polynomial BIT Numerical Mathematics, 21 (1). pp. 104-111. ISSN 0006-3835
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/qn711m44r40575...
Related URL: http://dx.doi.org/10.1007/BF01934075
Abstract
A global recursive bisection algorithm is described for computing the complex zeros of a polynomial. It has complexity O(n3 p) wheren is the degree of the polynomial and p the bit precision requirement. If n processors are available, it can be realized in parallel with complexityO(n 2 p); also it can be implemented using exact arithmetic. A combined Wilf-Hansen algorithm is suggested for reduction in complexity.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer-Verlag. |
| ID Code: | 28205 |
| Deposited On: | 15 Dec 2010 12:25 |
| Last Modified: | 04 Jun 2011 07:03 |
Repository Staff Only: item control page
