Publisher
Springer Science and Business Media LLC
Reference45 articles.
1. O. Aberth, Iteration methods for finding all zeros of a polynomial simultaneously, Math. Comp. 27(122) (1973) 339–344.
2. D. A. Adams, A stopping criterion for polynomial root finding, Comm. ACM 10 (1967) 655–658.
3. G. Alefeld and J. Herzberger, On the convergence speed of some algorithms for the simultaneous approximation of polynomial roots, SIAM J. Numer. Anal. 11(2) (1974) 237–243.
4. M. Ben-Or and P. Tiwari, Simple algorithms for approximating all roots of a polynomial with real roots, J. Complexity 6 (1990) 417–442.
5. D. Bini and G. Fiorentino, A multiprecision implementation of a poly-algorithm for univariate polynomial zeros, in:Proc. of the POSSO Workshop on Software, eds. J. C. Faugère, J. Marchand and R. Rioboo (Paris, 1995).
Cited by
80 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献