---

＜E-Book＞
Computer Algebra and Parallelism : Second International Workshop, Ithaca, USA, May 9-11, 1990. Proceedings / edited by Richard E. Zippel
(Lecture Notes in Computer Science. ISSN:16113349 ; 584)

Edition	1st ed. 1992.
Publisher	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
Year	1992
Language	English
Size	XI, 117 p : online resource
Authors	Zippel, Richard E editor SpringerLink (Online service)
Subjects	LCSH:Computer systems LCSH:Algebra LCSH:Computer science -- Mathematics  All Subject Search LCSH:Electronic digital computers -- Evaluation  All Subject Search LCSH:Algorithms LCSH:Numerical analysis FREE:Computer System Implementation FREE:Algebra FREE:Symbolic and Algebraic Manipulation FREE:System Performance and Evaluation FREE:Algorithms FREE:Numerical Analysis
Notes	The S-threads environment for parallel symbolic computation -- Algebraic computing on a local net -- An environment for parallel algebraic computation -- Finite field arithmetic using the connection machine -- Embarrassingly parallel algorithms for algebraic number arithmetic — and some less trivial issues -- Parallel real root isolation using the coefficient sign variation method -- Very large Gröbner basis calculations -- Boolean Gröbner bases and their MIMD implementation This book contains papers presented at a workshop on the use of parallel techniques in symbolic and algebraic computation held at Cornell University in May 1990. The eight papers in the book fall into three groups. The first three papers discuss particular programming substrates for parallel symbolic computation, especially for distributed memory machines. The next three papers discuss novel ways of computing with elements of finite fields and with algebraic numbers. The finite field technique is especially interesting since it uses the Connection Machine, a SIMD machine, to achievesurprising amounts of parallelism. One of the parallel computing substrates is also used to implement a real root isolation technique. One of the crucial algorithms in modern algebraic computation is computing the standard, or Gr/bner, basis of an ideal. The final two papers discuss two different approaches to speeding their computation. One uses vector processing on the Cray and achieves significant speed-ups. The other uses a distributed memory multiprocessor and effectively explores the trade-offs involved with different interconnect topologies of the multiprocessors HTTP:URL=https://doi.org/10.1007/3-540-55328-2

 Similar Items