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

On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials

โœ Scribed by James Renegar

Publisher
Springer-Verlag
Year
1985
Tongue
English
Weight
672 KB
Volume
32
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on the complex roots of complex r
A note on the complex roots of complex random polynomials
โœ A. Ramponi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 96 KB

## By using the technique proposed in ), Trans. Amer. Math. Soc. 349, 2427 -2441] , we derive an exact formula for the mean number of complex roots of a complex random polynomial. The explicit evaluation of the average density is obtained in the case of multivariate normal coe cients and its co

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