Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference26 articles.
1. O. Aberth:Iteration method for finding all zeros of a polynomial simultaneously, Math. Comp. 27, 122, 339–344 (1973).
2. G. Alefeld and J. Herzberger:On the convergence speed of some algorithms for the simultaneous approximation of polynomials roots, SIAM Journ. Num. Anal. 11, 2, 237–243 (1974).
3. E. D. Angelova and K. I. Semerdziev:Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations, USRR Comput. Maths. Math. Phys. 22, 1, 226–232 (1982).
4. D. Bini:Complexity of parallel polynomial computations, inInternational Meeting on Parallel Computing, 115–127 (1988).
5. M. L. Lo Cascio, L. Pasquini, D. Trigiante:Simultaneous determination of polynomial complex roots and multiplicities: algorithm and problems involved. Tech. rep. Dip. di Metodi e Modelli Matematici per le Scienze Applicate, Univ. Roma, La Sapienza.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献