𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Topological complexity of a root finding algorithm

✍ Scribed by Myong-Hi Kim

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
587 KB
Volume
5
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Topological Complexity of Zero-Finding
Topological Complexity of Zero-Finding
✍ Erich Novak; Henry WoΕΊniakowski πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 272 KB
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

An Algorithm for Finding Recurrence Rela
An Algorithm for Finding Recurrence Relations of Binomial Sums and its Complexity
✍ Nobuki Takayama πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 355 KB

A new algorithm to find recurrence relations of binomial sums and a complexity analysis are given. The algorithm is based on the theory of hypergeometric functions and algorithmic method to get contiguity relations of hyperegeometric functions.