Fine and coarse grained parallel implementations of polynomial root finding algorithms
暂无分享，去创建一个
[1] D. Trigiante,et al. A globally convergent method for simultaneously finding polynomial roots , 1985 .
[2] E. D. Angelova,et al. Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations☆ , 1982 .
[3] V. Pan. Sequential and parallel complexity of approximate evaluation of polynomial zeros , 1987 .
[4] Pierre Fraigniaud. The Durand-Kerner polynomials roots-finding method in case of multiple roots , 1991 .
[5] Oliver Aberth,et al. Iteration methods for finding all zeros of a polynomial simultaneously , 1973 .
[6] Dario Bini,et al. On the Complexity of Polynomial Zeros , 1992, SIAM J. Comput..
[7] George E. Collins,et al. Subresultants and Reduced Polynomial Remainder Sequences , 1967, JACM.
[8] René Alt,et al. Computing roots of polynomials on vector processing machines , 1985 .
[9] Pierre Fraigniaud,et al. Finding the roots of a polynomial on an MIMD multicomputer , 1990, Parallel Comput..
[10] Il V Makrelov,et al. Methods of finding simultaneously all the roots of algebraic, trigonometric, and exponential equations , 1986 .