A parallel wilf algorithm for complex zeros of a polynomial
| Data(s) |
01/03/1981
|
|---|---|
| Resumo |
A global recursive bisection algorithm is described for computing the complex zeros of a polynomial. It has complexityO(n 3 p) wheren is the degree of the polynomial andp the bit precision requirement. Ifn 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. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/22831/1/66.pdf Krishnamurthy, EV and Venkateswaran, H (1981) A parallel wilf algorithm for complex zeros of a polynomial. In: BIT Numerical Mathematics, 21 (1). pp. 104-111. |
| Publicador |
springer |
| Relação |
http://www.springerlink.com/content/qn711m44r4057573/ http://eprints.iisc.ernet.in/22831/ |
| Palavras-Chave | #Others |
| Tipo |
Journal Article PeerReviewed |
