๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel algorithms for finding polynomial Roots on

โœ Scribed by Keny T. Lucas; Prasanta K. Jana

Publisher
Springer US
Year
2009
Tongue
English
Weight
1016 KB
Volume
54
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal algorithms for parallel polynomi
Optimal algorithms for parallel polynomial evaluation
โœ Ian Munro; Michael Paterson ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

Algorithms for the evaluation of polynomials on a hypothetical computer with k independent arithmetic processors are presented. It is shown that, provided the degree of the polynomial to be evaluated exceeds k[Iog2 k], an algorithm given is within one time unit of optimality.

Finding polynomial roots: A fast algorit
Finding polynomial roots: A fast algorithm convergent on the complex plane
โœ Ivanisov, Andrey V. ;Polishchuk, Vadim K. ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 351 KB ๐Ÿ‘ 1 views

An algorithm is suggested which performs fast calculations of all the roots of a polynomial with maximal computer accuracy using, as the only primary information, the coefficients and the degree of the polynomial. The algorithm combines global as well as local convergences, i.e. it ensures a rapid h

Univariate Polynomials: Nearly Optimal A
Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding
โœ Victor Y. Pan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 552 KB

To approximate all roots (zeros) of a univariate polynomial, we develop two effective algorithms and combine them in a single recursive process. One algorithm computes a basic well isolated zero-free annulus on the complex plane, whereas another algorithm numerically splits the input polynomial of t