𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal sequential and parallel seach for finding a root

✍ Scribed by Shmuel Gal; Willard Miranker

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
604 KB
Volume
23
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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