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

A parallel algorithm for finding roots of a complex polynomial

โœ Scribed by Jinsong Cheng

Book ID
112948604
Publisher
Springer
Year
1990
Tongue
English
Weight
503 KB
Volume
5
Category
Article
ISSN
1000-9000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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