𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asynchronous polynomial zero-finding algorithms

✍ Scribed by T.L. Freeman; M.K. Bane

Book ID
104304345
Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
453 KB
Volume
17
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

Frequent synchronisations have a significant effect on the efficiency of parallel numerical algorithms. In this paper we consider simultaneous polynomial zero-finding algorithms and analyse, both theoretically and numerically, the effect of removing the synchronisation restriction from these algorithms.

πŸ“œ SIMILAR VOLUMES

Congruence arithmetic algorithms for pol
Congruence arithmetic algorithms for polynomial real zero determination
✍ Lee E. Heindel πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 903 KB

This paper describes a set of algorithms for isolating the real zeros of a univariate polynomial with integer coefficients. The algorithms employ congruence (modular, finite field) arithmetic and are analogous to a set of integer arithmetic algorithms described by the author in a recent paper. The a