Computer Algebra and Parallelism: Second International Workshop, Ithaca, USA, May 9-11, 1990. Proceedings (Lecture Notes in Computer Science, 584)

ISBN 10: 3540553282 / ISBN 13: 9783540553281

Published by Springer, 1992

About this Item

A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.

Seller Inventory # OTV.3540553282.G

Bibliographic Details

• Title: Computer Algebra and Parallelism: Second International Workshop, Ithaca, USA, May 9-11, 1990. Proceedings (Lecture Notes in Computer Science, 584)
• Publisher: Springer
• Publication Date: 1992
• Language: English
• ISBN 10: 3540553282
• ISBN 13: 9783540553281
• Binding: Soft cover
• Condition: good

About this title

Synopsis

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.