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

Finding the roots of a polynomial on an MIMD multicomputer

โœ Scribed by Michel Consnard; Pierre Fraigniaud


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
603 KB
Volume
15
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Finding polynomial roots: A fast algorit
โœ 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