𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel methods for solving equations

✍ Scribed by W.L. Miranker

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
730 KB
Volume
20
Category
Article
ISSN
0378-4754

No coin nor oath required. For personal study only.

✦ Synopsis

Two classes of algorithms for equation solving are presented and analyzed. These algorithms have been devised in recent years because of the computational facility of the multiprocessor. The first class consists of parallel search methods while the second class consists of asynchronous methods. The first class of methods are fail safe. That is they always provide an approximation to the root as well as the smallest possible interval (for the work done) guaranteed to contain the root. The second class frees the intrinsically interlocked nature of the more complicated forms of algorithms designed for multiprocessors by omitting the synchrony usually demanded in computation.

πŸ“œ SIMILAR VOLUMES

Sequential and parallel methods for solv
Sequential and parallel methods for solving first-order hyperbolic equations
✍ Arigu, M. A. ;Twizell, E. H. ;Gumel, A. B. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 478 KB

Techniques for two-time level difference schemes are presented for the numerical solution of first-order hyperbolic partial differential equations. The space derivative is approximated by (i) a low-order, and (ii) a higher-order backward difference replacement, resulting in a system of first-order o

Parallel p-adic method for solving linea
Parallel p-adic method for solving linear systems of equations
✍ Γ‡.K. KoΓ§ πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 488 KB

We present a parallel algorithm for an exact solution of an integer linear system of equations using the single modulus p-adic expansion technique. More specifically, we parallelize an algorithm of Dixon, and present our implementation results on a distributed-memory multiprocessor. The parallel alg